A family of ternary quasi-perfect BCH codes

DOI10.1007/s10623-008-9193-7zbMath1178.94235OpenAlexW2028973491MaRDI QIDQ1009088

Stefan Dodunekov, Danyo Danev

Publication date: 31 March 2009

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-008-9193-7

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cyclic codes (94B15) Decoding (94B35)

Related Items (3)

Quasi-perfect linear codes from planar and APN functions ⋮ A family of constacyclic ternary quasi-perfect codes with covering radius 3 ⋮ On ternary Kloosterman sums modulo 12

Cites Work

• Two-error correcting Bose-Chaudhuri codes are quasi-perfect
• Quasi-Perfect Codes With Small Distance
• On the performance of the ternary [13, 7, 5 quadratic-residue code]
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A family of ternary quasi-perfect BCH codes