On the evaluation of minimum distance of binary arithmetic cyclic codes

DOI10.1109/TIT.1969.1054346MaRDI QIDQ5568907zbMATH OpenOpenAlexFDO

Authors

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.1054346

zbMATH Keywords

information, communication

Cited in

(1)

• Cyclic codes over GF(q) with simple orbit structure

This page was built for publication: On the evaluation of minimum distance of binary arithmetic cyclic codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5568907)