On decoding BCH codes
From MaRDI portal
Publication:5519678
DOI10.1109/TIT.1965.1053825zbMath0143.41401OpenAlexW2153936403WikidataQ56081992 ScholiaQ56081992MaRDI QIDQ5519678
Publication date: 1965
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1965.1053825
Related Items
Several classes of optimal ternary cyclic codes with minimal distance four, A family of optimal ternary cyclic codes with minimum distance five and their duals, Fast BCH Syndrome Coding for Steganography, Construction and decoding of BCH codes over chain of commutative rings, Two families of optimal ternary cyclic codes with minimal distance four, An infinite family of antiprimitive cyclic codes supporting Steiner systems \(S(3,8, 7^m+1)\), Binary cyclic codes from explicit polynomials over \(\mathrm{GF}(2^m)\), A family of cyclic codes with two zeros, Some \(q\)-ary cyclic codes from explicit monomials over \(\mathbb{F}_{q^m}\), Weight enumerators of some irreducible cyclic codes of odd length, A sequence construction of cyclic codes over finite fields, Some 3-designs and shortened codes from binary cyclic codes with three zeros, Optimal quinary negacyclic codes with minimum distance four, Cyclic codes from cyclotomic sequences of order four, A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes, Primitive to non-primitive BCH codes: An instantaneous path shifting scheme for data transmission, Unnamed Item, Constructions of cyclic quaternary constant-weight codes of weight three and distance four, At the dawn of the theory of codes, Gröbner bases over Galois rings with an application to decoding alternant codes, Correcting errors and erasures via the syndrome variety, A note on cyclic codes from APN functions, A construction scheme for linear and non-linear codes, Construction and decoding of BCH codes over finite commutative rings, The decoding of extended Reed-Solomon codes
