A family of constacyclic ternary quasi-perfect codes with covering radius 3 (Q2430709): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10623-010-9470-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2097175178 / rank | |||
Normal rank | |||
Revision as of 03:40, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A family of constacyclic ternary quasi-perfect codes with covering radius 3 |
scientific article |
Statements
A family of constacyclic ternary quasi-perfect codes with covering radius 3 (English)
0 references
8 April 2011
0 references
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.
0 references
quasi-perfect codes
0 references
covering radius
0 references
packing radius
0 references
