Some results on the minimum distance structure of cyclic codes
From MaRDI portal
Publication:5652537
DOI10.1109/TIT.1972.1054816zbMATH Open0241.94014MaRDI QIDQ5652537FDOQ5652537
Kenneth K. Tzeng, Robert Tienwen Chien, Carlos R. P. Hartmann
Publication date: 1972
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Cited In (9)
- On some bounds on the minimum distance of cyclic codes over finite fields
- Title not available (Why is that?)
- Algebraic theory of block codes detecting independent errors
- Title not available (Why is that?)
- Double-error-correcting cyclic codes and absolutely irreducible polynomials over \(\text{GF}(2)\)
- Several classes of optimal \(p\)-ary cyclic codes with minimum distance four
- A survey of constructive coding theory, and a table of binary codes of highest known rate
- More on the minimum distance of cyclic codes
- On the Minimal Distance of Binary Self-Dual Cyclic Codes
Recommendations
This page was built for publication: Some results on the minimum distance structure of cyclic codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5652537)