Some new results for optimal ternary linear codes

Autor:	Iliya Bouyukliev, Juriaan Simonis
Rok vydání:	2002
Předmět:	Discrete mathematics Combinatorics Code (set theory) Finite field Binary code Hamming distance Extension (predicate logic) Library and Information Sciences Ternary operation Linear code Computer Science Applications Information Systems Mathematics
Zdroj:	IEEE Transactions on Information Theory. 48:981-985
ISSN:	0018-9448
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::5134ba69cd5f205cf64238ca46c6244b https://doi.org/10.1109/18.992814 Zobrazit plný text záznamu