Bounds on the minimum distance of the duals of extended BCH codes over \(\mathbb{F}_ p\)

DOI10.1007/BF01195336zbMath0837.94020OpenAlexW2092279061MaRDI QIDQ1842608

Françoise Levy-dit-Vehel

Publication date: 4 May 1995

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01195336

zbMATH Keywords

finite fieldsaffine- invariant codeduals of extended BCH codesRoos and Weil bounds

Mathematics Subject Classification ID

Bounds on codes (94B65) Cyclic codes (94B15)

Cites Work

• Codes cycliques étendus affines-invariants et antichaines d'un ensemble partiellement ordonné. (Affine-invariant extended cyclic codes and antichains of a partially ordered set.)
• Divisible codes
• Weight congruence for p-ary cyclic codes
• On a class of primitive BCH-codes
• A new lower bound for the minimum distance of a cyclic code
• On the number of information symbols in Bose-Chaudhuri codes
• The MacWilliams-Sloane conjecture on the tightness of the Carlitz-Uchiyama bound and the weights of duals of BCH codes
• Some results on cyclic codes which are invariant under the affine group and their applications
• On the weight structure of Reed-Muller codes
• Generalizations of the BCH bound
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounds on the minimum distance of the duals of extended BCH codes over \(\mathbb{F}_ p\)