Some Remarks on BCH Bounds and Minimum Weights of Binary Primitive BCH Codes
From MaRDI portal
Publication:5558766
DOI10.1109/TIT.1969.1054304zbMath0172.43301OpenAlexW2153848652MaRDI QIDQ5558766
Publication date: 1969
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1969.1054304
Related Items (11)
Algebraic theory of block codes detecting independent errors ⋮ The Minimum Distance of Some Narrow-Sense Primitive BCH Codes ⋮ BCH cyclic codes ⋮ BCH Codes with Minimum Distance Proportional to Code Length ⋮ A class of primitive BCH codes and their weight distribution ⋮ A class of narrow-sense BCH codes over \(\mathbb{F}_q\) of length \(\frac{q^m-1}{2} \) ⋮ New codes via the lengthening of BCH codes with UEP codes ⋮ Extending and lengthening BCH codes. ⋮ A survey of constructive coding theory, and a table of binary codes of highest known rate ⋮ Density doubling, double-circulants, and new sphere packings ⋮ On the covering radius of cyclic linear codes and arithmetic codes
This page was built for publication: Some Remarks on BCH Bounds and Minimum Weights of Binary Primitive BCH Codes
