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

zbMATH Open1329.94092MaRDI QIDQ890890FDOQ890890

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cited In (6)

• Title not available (Why is that?)
• Constructions of partitions of \(F_q^N\) into perfect \(q\)-ary codes
• Title not available (Why is that?)
• On the partition of the space \(F_q^N\) into affine-nonequivalent perfect \(q\)-ary codes
• 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)