scientific article; zbMATH DE number 1811348

MaRDI QIDQ3148508zbMATH OpenFDO

Authors Denis S. Krotov

Publication date 6 October 2002

zbMATH Keywords

perfect code\(m\)-quasigroup

Mathematics Subject Classification ID

Combinatorial codes (94B25) Loops, quasigroups (20N05)

Recommendations

• On a lower bound on the number of perfect binary codes
• Construction of perfect binary codes by sequential shifts of -components
• On switching equivalence of \(n\)-ary quasigroups of order 4 and perfect binary codes
• On the number of \(q\)-ary quasi-perfect codes with covering radius 2
• Construction of perfect \(q\)-ary codes by sequential switchings of \(\tilde\alpha\)-components

Cited in

(6)

• A coding problem in steganography
• On the classification of perfect codes: extended side class structures
• On switching equivalence of \(n\)-ary quasigroups of order 4 and perfect binary codes
• On perfect binary codes
• Maximal partial packings of \(\mathbb Z_2^n\) with perfect codes
• Perfect codes from the dual point of view. I

This page was built for publication:

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