Subfield Subcodes and Trace Codes

Improvements on Generalized Hamming Weights of Some Trace Codes

Designs Codes and Cryptography ◽

10.1007/s10623-005-3394-0 ◽

2006 ◽

Vol 39 (2) ◽

pp. 215-231 ◽

Cited By ~ 4

Author(s):

Cem Güneri ◽

Ferruh Özbudak

Keyword(s):

Generalized Hamming Weights ◽

Trace Codes ◽

Hamming Weights

Download Full-text

Two-weight and three-weight codes from trace codes overFp+uFp+vFp+uvFp

Discrete Mathematics ◽

10.1016/j.disc.2017.09.003 ◽

2018 ◽

Vol 341 (2) ◽

pp. 350-357 ◽

Cited By ~ 7

Author(s):

Yan Liu ◽

Minjia Shi ◽

Patrick Solé

Keyword(s):

Trace Codes

Download Full-text

Few-weight codes from trace codes over a local ring

Applicable Algebra in Engineering Communication and Computing ◽

10.1007/s00200-017-0345-8 ◽

2017 ◽

Vol 29 (4) ◽

pp. 335-350 ◽

Cited By ~ 8

Author(s):

Minjia Shi ◽

Liqin Qian ◽

Patrick Solé

Keyword(s):

Local Ring ◽

Trace Codes

Download Full-text

Subfield codes and trace codes

Introduction to Coding Theory ◽

10.1201/9781315371993-14 ◽

2016 ◽

pp. 135-150

Author(s):

Jürgen Bierbrauer

Keyword(s):

Trace Codes

Download Full-text

Simulation of Loss of RHRs Sequences in PKL Facility with RELAP5 and Trace Codes

Nuclear Technology ◽

10.13182/nt10-a10772 ◽

2010 ◽

Vol 171 (1) ◽

pp. 53-73 ◽

Cited By ~ 2

Author(s):

César Queral ◽

Antonio Expósito ◽

Alberto Concejal ◽

Pablo Niesutta

Keyword(s):

Trace Codes

Download Full-text

Galois invariance, trace codes and subfield subcodes

Finite Fields and Their Applications ◽

10.1016/j.ffa.2010.01.002 ◽

2010 ◽

Vol 16 (2) ◽

pp. 96-99 ◽

Cited By ~ 12

Author(s):

Marta Giorgetti ◽

Andrea Previtali

Keyword(s):

Trace Codes

Download Full-text

Small-bias sets from extended norm-trace codes

Theory and Applications of Finite Fields - Contemporary Mathematics ◽

10.1090/conm/579/11526 ◽

2012 ◽

pp. 143-152

Author(s):

Gretchen Matthews ◽

Justin Peachey

Keyword(s):

Trace Codes

Download Full-text

Cyclotomic Trace Codes

Algorithms ◽

10.3390/a12080168 ◽

2019 ◽

Vol 12 (8) ◽

pp. 168

Author(s):

Dean Crnković ◽

Andrea Švob ◽

Vladimir D. Tonchev

Keyword(s):

Quantum Codes ◽

Strongly Regular Graphs ◽

Block Designs ◽

Regular Graphs ◽

Combinatorial Structures ◽

Trace Codes ◽

Strongly Regular ◽

Projective Codes

A generalization of Ding’s construction is proposed that employs as a defining set the collection of the sth powers ( s ≥ 2 ) of all nonzero elements in G F ( p m ) , where p ≥ 2 is prime. Some of the resulting codes are optimal or near-optimal and include projective codes over G F ( 4 ) that give rise to optimal or near optimal quantum codes. In addition, the codes yield interesting combinatorial structures, such as strongly regular graphs and block designs.

Download Full-text