DocumentCode
2391401
Title
On the covering radius of ternary negacyclic codes with length up to 26
Author
Baicheva, Tsonka S.
Author_Institution
Inst. of Math. & Inf., Bulgarian Acad. of Sci., Bulgaria
fYear
2000
fDate
2000
Firstpage
392
Abstract
The covering radius of all ternary negacyclic codes of even length up to 26 is given. The minimal distances and weight spectra of all codes were recalculated. Seven of the open cases for the least covering radius of ternary linear codes were solved and for the other three cases upper bounds were improved
Keywords
cyclic codes; linear codes; ternary codes; covering radius; even length codes; minimal distances; ternary linear codes; ternary negacyclic codes; upper bounds; weight spectra; Books; Contracts; Cryptography; Informatics; Linear code; Mathematics; Polynomials; Upper bound; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location
Sorrento
Print_ISBN
0-7803-5857-0
Type
conf
DOI
10.1109/ISIT.2000.866690
Filename
866690
Link To Document