Perfect binary codes of infinite length with complete system of triples

DOI10.17377/SEMI.2017.14.074zbMATH Open1386.94113MaRDI QIDQ1685366FDOQ1685366

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)

Cites Work

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

Cited In (2)

• 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)