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

DOI10.1007/S10623-010-9470-0MaRDI QIDQ2430709zbMATH OpenOpenAlexFDO

Authors Danyo Danev, Stefan Dodunekov, Diana Radkova

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)

Review text

A code \(C\subset GF(q)^n\) is constacyclic respect to \(a\in GF(q)^\times\) (or \(a\)-constacyclic) if \((c_1,\dots,c_n)\in C\) implies \((ac_n,c_1,\dots, c_{n-1})\in C\), for \(c_i\in GF(q)\). This paper constructs and infinite family of \((-1)\)-constacyclic codes over \(GF(3)\) having covering radius \(\rho = 3\) and minimum distance \(d=5\). The paper concludes with a list of interesting open problems.

Recommendations

• A family of ternary quasi-perfect BCH codes
• On the number of q-ary quasi-perfect codes with covering radius 2
• On the covering radius of ternary negacyclic codes with length up to 26
• Optimal ternary quasi-cyclic codes
• On perfect ternary constant weight codes

Cites work

• A family of ternary quasi-perfect BCH codes
• Binary and Ternary Linear Quasi-Perfect Codes With Small Dimensions
• Constacyclic codes as invariant subspaces
• scientific article; zbMATH DE number 3910296 (Why is no real title available?)
• scientific article; zbMATH DE number 3922530 (Why is no real title available?)
• scientific article; zbMATH DE number 4021019 (Why is no real title available?)
• scientific article; zbMATH DE number 3455135 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 3616332 (Why is no real title available?)
• On ternary Kloosterman sums modulo 12
• On the performance of the ternary [13, 7, 5] quadratic-residue code
• Quasi-Perfect Codes With Small Distance

Cited in

(8)

• A family of ternary quasi-perfect BCH codes
• On the minimum distance of negacyclic codes with two zeros
• Quasi-perfect linear codes from planar and APN functions
• Several families of irreducible constacyclic and cyclic codes
• Two classes of constacyclic codes with variable parameters
• MDS constacyclic codes of length \(q+1\) over \(\mathrm{GF}(q)\)
• Negacyclic BCH codes of length \(\frac{q^{2m}-1}{q+1}\) and their duals
• Une nouvelle famille de 3-codes parfaits sur GF(q)

This page was built for publication: A family of constacyclic ternary quasi-perfect codes with covering radius 3

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