Perfect codes from the dual point of view I
2008 (English)In: Discrete Mathematics, ISSN 0012-365X, E-ISSN 1872-681X, Vol. 308, no 24, 6141-6156 p.Article in journal (Refereed) Published
The two concepts dual code and parity check matrix for a linear perfect 1-error correcting binary code are generalized to the case of non-linear perfect codes. We show how this generalization can be used to enumerate some particular classes of perfect 1-error correcting binary codes. We also use it to give an answer to a problem of Avgustinovich: whether or not the kernel of every perfect 1-error correcting binary code is always contained in some Hamming code.
Place, publisher, year, edition, pages
2008. Vol. 308, no 24, 6141-6156 p.
Perfect codes, error-correcting codes, rank
IdentifiersURN: urn:nbn:se:kth:diva-18014DOI: 10.1016/j.disc.2007.11.037ISI: 000261259100025ScopusID: 2-s2.0-56649123449OAI: oai:DiVA.org:kth-18014DiVA: diva2:336059
QC 201005252010-08-052010-08-05Bibliographically approved