Perfect binary codes of infinite length with complete system of triples

DOI10.17377/semi.2017.14.074zbMath1386.94113MaRDI QIDQ1685366

Sergey Artem'evich Malyugin

Publication date: 13 December 2017

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

zbMATH Keywords

perfect binary codecomponentcomplete system of triplescondition of sparsitynonsystematic code

Mathematics Subject Classification ID

Other types of codes (94B60)

Related Items (2)

Linear perfect codes of infinite length over infinite fields ⋮ Systematic and nonsystematic perfect codes of infinite length over finite fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Infinite-dimensional quasigroups of finite orders.
• \(\Phi\)-harmonic functions on discrete groups and the first \(\ell^\Phi\)-cohomology
• Rough isometries and the parabolicity of Riemannian manifolds
• On nonsystematic perfect binary codes.
• \(p\)-harmonic functions on graphs and manifolds
• Kernels of nonlinear Hamming codes
• A new proof of Gromov’s theorem on groups of polynomial growth
• Nonsystematic perfect codes
• Perfect binary codes of infinite length

This page was built for publication: Perfect binary codes of infinite length with complete system of triples