Exact lower bounds on the codelength of three-step permutation-decodable cyclic codes

DOI10.1109/18.165457MaRDI QIDQ4024561zbMATH OpenOpenAlexFDO

Authors Ming Jia, Anader Benyamin-Seeyar, Tho Le-Ngoc

Publication date 4 February 1993

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.165457

zbMATH Keywords

error trappinglower bounds on codelengthpermutation decodable binary cyclic codes

Mathematics Subject Classification ID

Cyclic codes (94B15) Bounds on codes (94B65)

Recommendations

• Capability of the error-trapping technique in decoding cyclic codes
• On the minimum distance of ternary cyclic codes
• Permutation Decoding of Systematic Codes
• General Error Locator Polynomials for Binary Cyclic Codes With <formula formulatype="inline"><tex>$t \le 2$</tex></formula> and <formula formulatype="inline"> <tex>$n &lt; 63$</tex></formula>
• A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes

This page was built for publication: Exact lower bounds on the codelength of three-step permutation-decodable cyclic codes

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