DocumentCode
1256907
Title
A note on perfect multiple coverings of the Hamming space
Author
van Wee, G.J.M. ; Cohen, G.D. ; Litsyn, S.N.
Author_Institution
Dept. of Math. & Comput. Sci., Eindhoven Univ. of Technol., Netherlands
Volume
37
Issue
3
fYear
1991
fDate
5/1/1991 12:00:00 AM
Firstpage
678
Lastpage
682
Abstract
Let Q be an alphabet of size q>or=2. The Hamming space Qn that consists of all n-tuples of elements of Q is a metric space, provided with the Hamming distance function. A perfect multiple covering (PMC) is a code C in Qn such that there exist fixed numbers r and mu with the property that every word in Qn is within distance r from exactly mu codewords of C. The authors give a few constructions of PMCs and investigate in detail the problem of determining all possible parameters of PMCs with r=1.
Keywords
decoding; error correction codes; Hamming space; code; decoding; perfect multiple coverings; Block codes; Cyclic redundancy check; Error correction; Error probability; Galois fields; Hamming distance; Hydrogen;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.79931
Filename
79931
Link To Document