Optimal ternary linear codes

Autor: Ray Hill, D. E. Newton
Rok vydání: 1992
Předmět:
Zdroj: Designs, Codes and Cryptography. 2:137-157
ISSN: 1573-7586
0925-1022
DOI: 10.1007/bf00124893
Popis: Let n q (k, d) denote the smallest value of n for which there exists a linear [n, k, d]-code over GF(q). An [n, k, d]-code whose length is equal to n q (k, d) is called optimal. The problem of finding n q (k, d)has received much attention for the case q = 2. We generalize several results to the case of an arbitrary prime power q as well as introducing new results and a detailed methodology to enable the problem to be tackled over any finite field. In particular, we study the problem with q = 3 and determine n 3(k, d) for all d when k ≤ 4, and n 3(5, d) for all but 30 values of d.
Databáze: OpenAIRE
Externí odkaz: