Orthogonality of binary codes derived from Reed-Solomon codes

DOI10.1109/18.86992MaRDI QIDQ3360802zbMATH OpenOpenAlexFDO

Authors Charles T. Retter

Publication date 1991

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

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

zbMATH Keywords

dual codesorthogonalityReed-Solomon codesself-dual bases

Mathematics Subject Classification ID

Cyclic codes (94B15)

Recommendations

• Gaps in the binary weight distributions of Reed-Solomon codes
• Binary weight spectrum of the extended \([2^m,5]\) Reed-Solomon code and its dual code
• On the undetected error probability of binary expansions of Reed-Solomon codes
• On even codes
• Non binary codes and ``Mathematica calculations: Reed-Solomon codes over \(\text{GF}(2^n)\)

Cited in

(5)

• Orthogonal vectors in the n-dimensional cube and codes with missing distances
• Co-orthogonal codes
• Gaps in the binary weight distributions of Reed-Solomon codes
• On a necessary condition for L-step orthogonalization of linear codes and its applications
• New constructions of optimal binary LCD codes

This page was built for publication: Orthogonality of binary codes derived from Reed-Solomon codes

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