PARTITIONS OF F-n INTO NON-PARALLEL HAMMING CODES
2009 (English)Article in journal (Refereed) Published
We investigate partitions of the set F-n of all binary vectors of length n into cosets of pairwise distinct linear Hamming codes ("non-parallel Hamming codes") of length n. We present several constructions of partitions of F-n into non-parallel Hamming codes of length n and discuss a lower bound on the number of different such partitions.
Place, publisher, year, edition, pages
2009. Vol. 3, no 4, 385-397 p.
Perfect code, Hamming code, non-parallel Hamming codes, Phelps partition, perfect codes
IdentifiersURN: urn:nbn:se:kth:diva-19095DOI: 10.3934/amc.2009.3.385ISI: 000273229300006ScopusID: 2-s2.0-72049113332OAI: oai:DiVA.org:kth-19095DiVA: diva2:337142
QC 201005252010-08-052010-08-052010-12-23Bibliographically approved