On some classes of optimal and near-optimal polynomial codes. (Q1418180)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On some classes of optimal and near-optimal polynomial codes. |
scientific article; zbMATH DE number 2029207
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On some classes of optimal and near-optimal polynomial codes. |
scientific article; zbMATH DE number 2029207 |
Statements
On some classes of optimal and near-optimal polynomial codes. (English)
0 references
19 January 2004
0 references
The authors generalize the construction of \textit{C. Xing} and \textit{S. Ling} [IEEE Trans. Inf. Theory 46, 2184--2188 (2000; Zbl 1003.94031)] of a class of \(q\)-ary linear codes by evaluating a suitably chosen set of polynomials over \(\mathbb F_q\) at elements of an extension field of prime degree. In particular, they obtain a new linear code over \(\mathbb F_5\) and many codes with the best-known parameters (according to Brouwer's table).
0 references
Reed-Solomon codes
0 references
Brouwer's table
0 references
polynomials
0 references
linear codes
0 references
0 references
0.88940066
0 references
0.88817966
0 references
0.8867857
0 references
