Systematic and nonsystematic perfect codes of infinite length over finite fields

DOI10.33048/semi.2019.16.122zbMath1472.94082OpenAlexW3016243433MaRDI QIDQ2279482

Sergey Artem'evich Malyugin

Publication date: 12 December 2019

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

Full work available at URL: https://doi.org/10.33048/semi.2019.16.122

zbMATH Keywords

componentperfect \(q\)-ary codecomplete system of triplesnonsystematic codecode of infinite lengthcondition of sparsity 1systematic code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (1)

Projective tilings and full-rank perfect codes

Cites Work

• Unnamed Item
• Unnamed Item
• Infinite-dimensional quasigroups of finite orders.
• On nonsystematic perfect binary codes.
• Perfect binary codes of infinite length with complete system of triples
• Embedding in \(q\)-ary 1-perfect codes and partitions
• Construction of perfect \(q\)-ary codes by sequential switchings of \(\tilde\alpha\)-components
• Propelinear 1-Perfect Codes From Quadratic Functions
• Nonsystematic perfect codes
• Local spectra of perfect binary codes
• On nonsystematic perfect binary codes of length 15
• Perfect binary codes of infinite length
• On linear and nonlinear single-error-correcting q-nary perfect codes
• Introduction to Coding Theory

This page was built for publication: Systematic and nonsystematic perfect codes of infinite length over finite fields