The Enumeration of Information Symbols in BCH Codes
From MaRDI portal
Publication:5560773
DOI10.1002/j.1538-7305.1967.tb03175.xzbMath0173.21202OpenAlexW1983551397MaRDI QIDQ5560773
Publication date: 1967
Published in: Bell System Technical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/j.1538-7305.1967.tb03175.x
Related Items (15)
The dimension and minimum distance of two classes of primitive BCH codes ⋮ Algebraic theory of block codes detecting independent errors ⋮ More results on hulls of some primitive binary and ternary BCH codes ⋮ The Minimum Distance of Some Narrow-Sense Primitive BCH Codes ⋮ Four infinite families of ternary cyclic codes with a square-root-like lower bound ⋮ BCH codes with larger dimensional hull ⋮ Improved construction of quantum constacyclic BCH codes ⋮ Three classes of BCH codes and their duals ⋮ Parameters of hulls of primitive binary narrow-sense BCH codes and their subcodes ⋮ BCH cyclic codes ⋮ BCH Codes with Minimum Distance Proportional to Code Length ⋮ A class of primitive BCH codes and their weight distribution ⋮ Extension of the Berlekamp-Massey algorithm to N dimensions ⋮ Parameters and characterizations of hulls of some projective narrow-sense BCH codes ⋮ The dual-containing primitive BCH codes with the maximum designed distance and their applications to quantum codes
This page was built for publication: The Enumeration of Information Symbols in BCH Codes
