On the performance of the ternary [13, 7, 5] quadratic-residue code

DOI10.1109/18.979334MaRDI QIDQ4544813zbMATH OpenOpenAlexFDO

Authors R. Kötter, Tsonka Stefanova Baicheva, Stefan Dodunekov

Publication date 4 August 2002

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

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

Mathematics Subject Classification ID

Decoding (94B35)

Recommendations

• scientific article; zbMATH DE number 1498800
• Algebraic decoding of the ternary (13,7,5) quadratic residue code
• Decoding the ternary (23, 11, 9) quadratic residue code
• Algebraic decoding of the ternary \((37,18,11)\) quadratic residue code
• Decoding the (73, 37, 13) quadratic residue code

Cited in

(9)

• A family of ternary quasi-perfect BCH codes
• A family of constacyclic ternary quasi-perfect codes with covering radius 3
• Algebraic decoding of the ternary (13,7,5) quadratic residue code
• A performance comparison of the binary quadratic residue codes with the 1/2-rate convolutional codes
• scientific article; zbMATH DE number 1498800 (Why is no real title available?)
• Algebraic decoding of the ternary \((37,18,11)\) quadratic residue code
• A survey on proper codes
• scientific article; zbMATH DE number 7720786 (Why is no real title available?)
• Decoding the ternary (23, 11, 9) quadratic residue code

This page was built for publication: On the performance of the ternary [13, 7, 5] quadratic-residue code

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