Construction of partitions of the set of all p-ary vectors of length p+1 into Hamming codes

MaRDI QIDQ890890zbMATH OpenFDO

Authors A. V. Los', K. I. Burnakov

Publication date 16 November 2015

Published in Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL http://semr.math.nsc.ru/v8/p372-380.pdf

zbMATH Keywords

Hamming codeswitchingspartition into codesperfect \(q\)-ary code

Mathematics Subject Classification ID

Partitions of sets (05A18) Linear codes (general theory) (94B05)

Recommendations

• Constructions of partitions of \(F_q^N\) into perfect \(q\)-ary codes
• Partitions of \(\mathbb F^n\) into non-parallel Hamming codes
• On the partition of the space F_q^N into affine-nonequivalent perfect q-ary codes
• On partitions of an n-cube into nonequivalent perfect codes
• scientific article; zbMATH DE number 2239556

Cited in

(6)

• On the partition of the space \(F_q^N\) into affine-nonequivalent perfect \(q\)-ary codes
• Constructions of partitions of \(F_q^N\) into perfect \(q\)-ary codes
• scientific article; zbMATH DE number 2239556 (Why is no real title available?)
• scientific article; zbMATH DE number 1882354 (Why is no real title available?)
• Partitions of \(\mathbb F^n\) into non-parallel Hamming codes
• 1-perfect uniform and distance invariant partitions

This page was built for publication: Construction of partitions of the set of all \(p\)-ary vectors of length \(p+1\) into Hamming codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q890890)