Title :
Upper bounds for q-ary covering codes
Author :
Ostergard, Patric R J
Author_Institution :
Digital Syst. Lab., Helsinki Univ. of Technol., Espoo, Finland
fDate :
5/1/1991 12:00:00 AM
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
Keywords :
codes; punctured Hamming codes; q-ary covering codes; seminormal codes; ternary covering codes; upper bounds; Binary codes; Communication system control; Error correction codes; Feedback; Galois fields; Information theory; Memoryless systems; Notice of Violation; Reliability theory; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
