Systematic and nonsystematic perfect codes of infinite length over finite fields
From MaRDI portal
Publication:2279482
DOI10.33048/SEMI.2019.16.122zbMATH Open1472.94082OpenAlexW3016243433MaRDI QIDQ2279482FDOQ2279482
Publication date: 12 December 2019
Published in: Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.33048/semi.2019.16.122
Recommendations
componentperfect \(q\)-ary codecomplete system of triplesnonsystematic codecode of infinite lengthcondition of sparsity 1systematic code
Cites Work
- Propelinear 1-Perfect Codes From Quadratic Functions
- Introduction to Coding Theory
- Infinite-dimensional quasigroups of finite orders.
- Local spectra of perfect binary codes
- On linear and nonlinear single-error-correcting q-nary perfect codes
- Title not available (Why is that?)
- On nonsystematic perfect binary codes of length 15
- Construction of perfect \(q\)-ary codes by sequential switchings of \(\tilde\alpha\)-components
- On nonsystematic perfect binary codes.
- Perfect binary codes of infinite length with complete system of triples
- Nonsystematic perfect codes
- Perfect binary codes of infinite length
- Embedding in \(q\)-ary 1-perfect codes and partitions
- Title not available (Why is that?)
Cited In (5)
This page was built for publication: Systematic and nonsystematic perfect codes of infinite length over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2279482)
