Title
Upper bounds for q-ary covering codes
Abstract
New methods for constructing q-ary covering codes are presented. The author introduces the concepts of (p-) seminormal and strongly (p-) seminormal codes and shows how seminormal codes and punctured Hamming codes can be combined to construct new covering codes. Using these methods, upper bounds for ternary covering codes are improved. The new bounds are K3
Year
DOI
Venue
1991
10.1109/18.79926
Information Theory, IEEE Transactions  
Keywords
DocType
Volume
seminormal code,punctured hamming code,new method,new bound,upper bound,feedback,reliability theory,information theory,galois fields,codes,binary codes,hamming code
Journal
37
Issue
ISSN
Citations 
3
0018-9448
19
PageRank 
References 
Authors
3.72
8
1
Name
Order
Citations
PageRank
Patric R. J. Östergård19212.09