Perfect binary codes of infinite length with complete system of triples

DOI10.17377/SEMI.2017.14.074MaRDI QIDQ1685366zbMATH OpenFDO

Authors Sergey Artem'evich Malyugin

Publication date 13 December 2017

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

zbMATH Keywords

componentcomplete system of triplescondition of sparsitynonsystematic codeperfect binary code

Mathematics Subject Classification ID

Other types of codes (94B60)

Recommendations

• Systematic and nonsystematic perfect codes of infinite length over finite fields
• Perfect binary codes of infinite length
• Perfect binary codes: constructions, properties, and enumeration
• scientific article; zbMATH DE number 503208
• Linear perfect codes of infinite length over infinite fields

Cites work

• scientific article; zbMATH DE number 4096435 (Why is no real title available?)
• scientific article; zbMATH DE number 1037961 (Why is no real title available?)
• scientific article; zbMATH DE number 202575 (Why is no real title available?)
• A new proof of Gromov’s theorem on groups of polynomial growth
• Infinite-dimensional quasigroups of finite orders.
• Kernels of nonlinear Hamming codes
• Nonsystematic perfect codes
• On nonsystematic perfect binary codes.
• Perfect binary codes of infinite length
• Rough isometries and the parabolicity of Riemannian manifolds
• \(\Phi\)-harmonic functions on discrete groups and the first \(\ell^\Phi\)-cohomology
• \(p\)-harmonic functions on graphs and manifolds

Cited in

(3)

• Perfect binary codes of infinite length
• Systematic and nonsystematic perfect codes of infinite length over finite fields
• Linear perfect codes of infinite length over infinite fields

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

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