On a class of wide-sense binary BCH codes whose minimum distances exceed the BCH bound (Corresp.)

DOI10.1109/TIT.1968.1054206zbMATH Open0165.22104MaRDI QIDQ5550274

A. G. Cerveira

Publication date: 1968

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

zbMATH Keywords

minimum distancesBCH boundbinary BCH codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (6)

Algebraic theory of block codes detecting independent errors ⋮ Title not available (Why is that?) ⋮ A non-cyclic triple-error-correcting BCH-like code and some minimum distance results ⋮ A class of narrow-sense BCH codes over \(\mathbb{F}_q\) of length \(\frac{q^m-1}{2} \) ⋮ On the minimum distance of the duals of 4-error correcting extended BCH codes ⋮ Bounds on the minimum distance of the duals of extended BCH codes over \(\mathbb{F}_ p\)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Cyclic and BCH codes whose minimum distance equals their maximum BCH bound 👍 👎
• Bounds on the minimum distance of the duals of extended BCH codes over \(\mathbb{F}_ p\) 👍 👎
• The dimension and minimum distance of two classes of primitive BCH codes 👍 👎
• The Bose and Minimum Distance of a Class of BCH Codes 👍 👎
• The Minimum Distance of Some Narrow-Sense Primitive BCH Codes 👍 👎
• Bounds on the minimum distance of the duals of BCH codes 👍 👎
• On the distance distributions of BCH codes and their duals 👍 👎

This page was built for publication: On a class of wide-sense binary BCH codes whose minimum distances exceed the BCH bound (Corresp.)

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