Minimal Codewords in Linear Codes
Serdica Mathematical Journal, Tome 30 (2004) no. 2-3, pp. 303-324.

Voir la notice de l'article provenant de la source Bulgarian Digital Mathematics Library

Cyclic binary codes C of block length n = 2^m − 1 and generator polynomial g(x) = m1(x)m2^s+1(x), (s, m) = 1, are considered. The cardinalities of the sets of minimal codewords of weights 10 and 11 in codes C and of weight 12 in their extended codes ^C are determined. The weight distributions of minimal codewords in the binary Reed-Muller codes RM (3, 6) and RM (3, 7) are determined. The applied method enables codes with larger parameters to be attacked.
Keywords: Codewords, Cyclic Codes, Binary Reed-Muller Code
@article{SMJ2_2004_30_2-3_a10,
     author = {Borissov, Yuri and Manev, Nickolai},
     title = {Minimal {Codewords} in {Linear} {Codes}},
     journal = {Serdica Mathematical Journal},
     pages = {303--324},
     publisher = {mathdoc},
     volume = {30},
     number = {2-3},
     year = {2004},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/SMJ2_2004_30_2-3_a10/}
}
TY  - JOUR
AU  - Borissov, Yuri
AU  - Manev, Nickolai
TI  - Minimal Codewords in Linear Codes
JO  - Serdica Mathematical Journal
PY  - 2004
SP  - 303
EP  - 324
VL  - 30
IS  - 2-3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SMJ2_2004_30_2-3_a10/
LA  - en
ID  - SMJ2_2004_30_2-3_a10
ER  - 
%0 Journal Article
%A Borissov, Yuri
%A Manev, Nickolai
%T Minimal Codewords in Linear Codes
%J Serdica Mathematical Journal
%D 2004
%P 303-324
%V 30
%N 2-3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SMJ2_2004_30_2-3_a10/
%G en
%F SMJ2_2004_30_2-3_a10
Borissov, Yuri; Manev, Nickolai. Minimal Codewords in Linear Codes. Serdica Mathematical Journal, Tome 30 (2004) no. 2-3, pp. 303-324. http://geodesic.mathdoc.fr/item/SMJ2_2004_30_2-3_a10/