Cyclic decoding procedures for Bose- Chaudhuri-Hocquenghem codes
From MaRDI portal
Publication:5329496
DOI10.1109/TIT.1964.1053699zbMath0125.09503MaRDI QIDQ5329496
Publication date: 1964
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items
New developments in \(q\)-polynomial codes, 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, On the lifted Zetterberg code, Decoding the triple-error-correcting (15, 5) binary BCH code by the analytic solution of the cubic error-locator polynomial over GF(24), 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)\), Generic error control coding modules, 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, Analysis of error-correcting codes for lattice-based key exchange, Unnamed Item, Constructions of cyclic quaternary constant-weight codes of weight three and distance four, The generalized Goertzel algorithm and its parallel hardware implementation, On the decoding of binary cyclic codes with the Newton identities, Information-dispersion-entropy-based blind recognition of binary BCH codes in soft decision situations, A note on cyclic codes from APN functions, Implementation of McEliece Based on Quasi-dyadic Goppa Codes for Embedded Devices
