DocumentCode
1443277
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., Veliko Tarnovo, Bulgaria
Volume
47
Issue
1
fYear
2001
fDate
1/1/2001 12:00:00 AM
Firstpage
413
Lastpage
416
Abstract
The covering radius of all ternary negacyclic codes of even length up to 26 is given. The minimum distances and weight distributions 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; minimum distances; ternary linear codes; ternary negacyclic codes; upper bounds; weight distributions; Boolean functions; Computer science; Cryptography; Error correction codes; Linear code; Linear programming; Notice of Violation;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.904549
Filename
904549
Link To Document