A note on perfect multiple coverings of the Hamming space

G.J.M. Wee, van, G.D. Cohen, S.N. Litsyn

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

10 Citaten (Scopus)


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.
Originele taal-2Engels
Pagina's (van-tot)678-682
TijdschriftIEEE Transactions on Information Theory
Nummer van het tijdschrift3
StatusGepubliceerd - 1991


Duik in de onderzoeksthema's van 'A note on perfect multiple coverings of the Hamming space'. Samen vormen ze een unieke vingerafdruk.

Citeer dit