Construction of perfect \(q\)-ary codes by sequential switchings of \(\tilde\alpha\)-components

DOI10.1023/B:PRIT.0000024878.62847.42zbMath1085.94022OpenAlexW1988321224MaRDI QIDQ2388466

A. V. Los'

Publication date: 14 September 2005

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:prit.0000024878.62847.42

zbMATH Keywords

Steiner triple systemHamming codeboundperfect codespecial-type component

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Bounds on codes (94B65) Triple systems (05B07)

Related Items (5)

On full-rank perfect codes over finite fields ⋮ Switching codes and designs ⋮ On perfect binary codes ⋮ Construction of perfect \(q\)-ary codes by switchings of simple components ⋮ Systematic and nonsystematic perfect codes of infinite length over finite fields

This page was built for publication: Construction of perfect \(q\)-ary codes by sequential switchings of \(\tilde\alpha\)-components