Title of article
Some new ternary linear codes
Author/Authors
daskalov, rumen technical university of gabrovo - department of mathematics, Bulgaria , hristov, plamen technical university of gabrovo - department of mathematics, Bulgaria
From page
227
To page
234
Abstract
Let an [n; k; d]q code be a linear code of length n, dimension k and minimum Hamming distance d over GF(q). One of the most important problems in coding theory is to construct codes with optimal minimum distances. In this paper 22 new ternary linear codes are presented. Two of them are optimal. All new codes improve the respective lower bounds in [11].
Keywords
Ternary linear codes , Construction X
Journal title
Journal Of Algebra Combinatorics Discrete Structures and Applications
Journal title
Journal Of Algebra Combinatorics Discrete Structures and Applications
Record number
2650179
Link To Document