Some new results for optimal ternary linear codes

@article{Bouyukliev2002SomeNR,
  title={Some new results for optimal ternary linear codes},
  author={Iliya Bouyukliev and Juriaan Simonis},
  journal={IEEE Trans. Inf. Theory},
  year={2002},
  volume={48},
  pages={981-985}
}
Let d/sub 3/(n,k) be the maximum possible minimum Hamming distance of a ternary [n,k,d]-code for given values of n and k. We describe a package for code extension and use this to prove some new exact values of d/sub 3/(n,k). Moreover, we classify the ternary [n,k,d/sub 3/(n,k)]-codes for some values of n and k. 

Tables from this paper

New bounds for n4(k, d) and classification of some optimal codes over GF(4)
The Nonexistence of Ternary [284, 6, 188] Codes
TLDR
The nonexistence of [284, 6, 188]3 codes is proved, whence the authors get n3 (6, 188) = 285 and n3(6, 189) = 286.
Some New Results on Optimal Codes Over F5
TLDR
It is proved that no AMDS code of length 13 and minimum distance 5 exists, and the projective strongly optimal Griesmer codes over F5 of dimension 4 for some values of the minimum distance are classified.
SEARCH FOR GOOD LINEAR CODES IN THE CLASS OF QUASI-CYCLIC AND RELATED CODES
This chapter gives an introduction to algebraic coding theory and a survey of constructions of some of the well known classes of algebraic block codes such as cyclic codes, BCH codes, Reed-Solomon
Some results for linear binary codes with minimum distance 5 and 6
TLDR
It is proved that a linear binary code with parameters [34,24,5] does not exist and some codes with minimum distance 5 and 6 are characterized.
On the minimum length of ternary linear codes
TLDR
These determine the exact value of n3(6,-d) for d = 100, 118–123, 130, 131, 132, 283–297, 341, 342, where nq(k, d) is the minimum length n for which an [n, k,–d]q code exists.
...
...

References

SHOWING 1-10 OF 27 REFERENCES
Optimal ternary linear codes
TLDR
This work generalizes 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 of finding nq(k, d) to be tackled over any finite field.
Some new results for ternary linear codes of dimension 5 and 6
  • M. Eupen
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1995
TLDR
Several new ternary linear codes of dimension 6 are found, including one two-weight code giving rise to a new strongly regular graph.
New ternary linear codes
TLDR
In this correspondence, 18 codes are constructed which improve the known lower bounds on minimum distance over GF(q) in this correspondence.
An optimal ternary [69, 5, 45] code and related codes
TLDR
It is shown that a ternary [70, 6, 45] code, which would have been a projective two-weight code giving rise to a new strongly regular graph, does not exist, and the uniqueness of some other optimal ternARY codes with specified weight enumerators is established.
Classification of Some Optimal Ternary Linear Codes of Small Length
TLDR
A classification is given of some optimal ternary linear codes of small length of up to minimum distance 12 for higher dimension where possible.
The smallest length of eight-dimensional binary linear codes with prescribed minimum distance
TLDR
It is proved that n(8,d) is the smallest integer n for which a binary linear code of length n, dimension 8, and minimum distance d exists.
Constructions of Optimal Linear Codes
TLDR
The interrelation between various definitions of optimality in terms of the basic parameters of a linear code: length, dimension and minimum distance is discussed.
There is no ternary [28, 6, 16] code
TLDR
It is shown that without loss of generality, a generator matrix of such a code must satisfy certain conditions, and a computer search over all matrices that satisfy these conditions reveals that a ternary code does not exist.
Five new optimal ternary linear codes
  • M. Eupen
  • Computer Science, Physics
    IEEE Trans. Inf. Theory
  • 1994
TLDR
Two new optimal ternary linear codes with parameters /spl lsqb/29,5,18/spl rsqb/, and / spl lsqB/31,6,18 /spl r sqb/ have been found.
...
...