A family of constacyclic ternary quasi-perfect codes with covering radius 3 (Q2430709): Difference between revisions

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.