Page 1

Displaying 1 – 3 of 3

Showing per page

Maximal circular codes versus maximal codes

Yannick Guesnet (2001)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We answer to a question of De Luca and Restivo whether there exists a circular code which is maximal as circular code and not as code.

Maximal circular codes versus maximal codes

Yannick Guesnet (2010)

RAIRO - Theoretical Informatics and Applications

We answer to a question of De Luca and Restivo whether there exists a circular code which is maximal as circular code and not as code.

Minimal Codewords in Linear Codes

Borissov, Yuri, Manev, Nickolai (2004)

Serdica Mathematical Journal

2000 Mathematics Subject Classification: 94B05, 94B15.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...

Currently displaying 1 – 3 of 3

Page 1