A family of constacyclic ternary quasi-perfect codes with covering radius 3

DOI10.1007/s10623-010-9470-0zbMath1211.94045OpenAlexW2097175178MaRDI QIDQ2430709

Stefan Dodunekov, Diana Radkova, Danyo Danev

Publication date: 8 April 2011

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

Full work available at URL: https://doi.org/10.1007/s10623-010-9470-0

zbMATH Keywords

covering radiuspacking radiusquasi-perfect codes

Mathematics Subject Classification ID

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

Related Items (4)

Quasi-perfect linear codes from planar and APN functions ⋮ On the minimum distance of negacyclic codes with two zeros ⋮ Several families of irreducible constacyclic and cyclic codes ⋮ Two classes of constacyclic codes with variable parameters

Cites Work

• On ternary Kloosterman sums modulo 12
• Constacyclic codes as invariant subspaces
• A family of ternary quasi-perfect BCH codes
• Quasi-Perfect Codes With Small Distance
• Binary and Ternary Linear Quasi-Perfect Codes With Small Dimensions
• 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 constacyclic ternary quasi-perfect codes with covering radius 3