On the minimum distance of the duals of 4-error correcting extended BCH codes

DOI10.1109/18.771243MaRDI QIDQ4701432zbMATH OpenOpenAlexFDO

Authors François Rodier

Publication date 21 November 1999

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.771243

zbMATH Keywords

exponential sumsminimum distanceBCH codesCarlitz-Uchiyama bound

Mathematics Subject Classification ID

Cyclic codes (94B15)

Recommendations

• Bounds on the minimum distance of the duals of extended BCH codes over \(\mathbb{F}_ p\)
• Bounds on the minimum distance of the duals of BCH codes
• scientific article; zbMATH DE number 139937
• Asymptotic estimation of the minimum distance of the duals of BCH codes and Dickson polynomials
• On the distance distributions of BCH codes and their duals
• Publication:4502654
• On the distance distribution of duals of BCH codes
• Dimension and minimum distance of a class of \(BCH\) codes
• On a class of wide-sense binary BCH codes whose minimum distances exceed the BCH bound (Corresp.)
• The minimum distance of some narrow-sense primitive BCH codes

Cited in

(4)

• scientific article; zbMATH DE number 139937 (Why is no real title available?)
• Bounds on the minimum distance of the duals of extended BCH codes over \(\mathbb{F}_ p\)
• The coset weight distributions of certain BCH codes and a family of curves.
• Improved estimates via exponential sums for the minimum distance of Z/sub 4/-linear trace codes

This page was built for publication: On the minimum distance of the duals of 4-error correcting extended BCH codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701432)