Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 0756.94008
Hill, R.; Newton, D.E.
Optimal ternary linear codes. (English)
[J] Des. Codes Cryptography 2, No.2, 137-157 (1992). ISSN 0925-1022; ISSN 1573-7586/e

Summary: Let $n\sb q(k,d)$ denote the smallest value of $n$ for which there exists a linear $[n,k,d]$-code over $\text{GF}(q)$. An $[n,k,d]$-code whose length is equal to $n\sb q(k,d)$ is called optimal. The problem of finding $n\sb 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\sb 3(k,d)$ for all $d$ when $k\le 4$, and $n\sb 3(5,d)$ for all but 30 values of $d$.

MSC 2000:: *94B05 General theory of linear codes

Keywords: optimal ternary linear codes

Cited in: Zbl 0873.05025 Zbl 0854.94020 Zbl 0756.94007

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]