Some long cyclic linear binary codes are not so bad
From MaRDI portal
Publication:4068576
DOI10.1109/TIT.1974.1055222zbMath0309.94023OpenAlexW2081931693MaRDI QIDQ4068576
Elwyn R. Berlekamp, Jørn Justesen
Publication date: 1974
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1974.1055222
Related Items (8)
Periodic distribution of generalized B-J codes and constructions of cyclically permutable (CP) codes. ⋮ Algebraic theory of block codes detecting independent errors ⋮ Binary cyclic codes from explicit polynomials over \(\mathrm{GF}(2^m)\) ⋮ Some \(q\)-ary cyclic codes from explicit monomials over \(\mathbb{F}_{q^m}\) ⋮ Complete decoding of doubly-extended Reed-Solomon codes of minimum distance 5 and 6 ⋮ Cyclic and pseudo-cyclic MDS codes of length \(q + 1\) ⋮ Coding for a multiple access OR channel: A survey ⋮ The weight enumerator polynomials of some classes of codes with composite parity-check polynomials
This page was built for publication: Some long cyclic linear binary codes are not so bad
