Some new ternary linear codes
Journal of Algebra Combinatorics Discrete Structures and Applications · 2017-09-15 · 4 (3) · 227-234
DOI: 10.13069/jacodesmath.327360 ↗At a glance
Journal article in Journal of Algebra Combinatorics Discrete Structures and Applications, published online on 2017-09-15. Written by Rumen Daskalov and 1 co-authors. Cited 3 times so far (Crossref). The full text is freely available (open access, CC BY 4.0).
Abstract (original language)
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].
Cite
APA
Daskalov, R., & Hristov, P. (2017). Some new ternary linear codes. Journal of Algebra Combinatorics Discrete Structures and Applications, 4(3), 227-234. https://doi.org/10.13069/jacodesmath.327360
Vancouver
Daskalov R, Hristov P. Some new ternary linear codes. Journal of Algebra Combinatorics Discrete Structures and Applications. 2017;4(3):227-234. doi:10.13069/jacodesmath.327360
BibTeX
@article{Daskalov2017,
author = {Daskalov, Rumen and Hristov, Plamen},
title = {Some new ternary linear codes},
journal = {Journal of Algebra Combinatorics Discrete Structures and Applications},
year = {2017},
volume = {4},
number = {3},
pages = {227--234},
doi = {10.13069/jacodesmath.327360}
}
EUVIMED