| Autor: |
Daskalov, Rumen, Hristov, Plamen |
| Předmět: |
|
| Zdroj: |
Journal of Algebra Combinatorics Discrete Structures & Applications; 2015, Vol. 2 Issue 3, p211-216, 6p |
| Abstrakt: |
Let [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 basic and most important problems in coding theory is to construct codes with best possible minimum distances. In this paper seven quasi-twisted ternary linear codes are constructed. These codes are new and improve the best known lower bounds on the minimum distance in [6]. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
