Embedding in \(q\)-ary 1-perfect codes and partitions

DOI10.1016/j.disc.2015.04.014zbMath1372.94474arXiv1412.3795OpenAlexW1875081033MaRDI QIDQ2352048

Ev V. Sotnikova, Denis S. Krotov

Publication date: 29 June 2015

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1412.3795

zbMATH Keywords

partitionsembeddingHamming code\(q\)-ary code1-perfect code1-code

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Related Items (4)

On non-full-rank perfect codes over finite fields ⋮ On the embedding of constant-weight codes into perfect codes ⋮ Embedding in MDS codes and Latin cubes ⋮ Systematic and nonsystematic perfect codes of infinite length over finite fields

Cites Work

• Ranks of \(q\)-ary 1-perfect codes
• Finite partial quadruple systems can be finitely embedded
• The completion of finite incomplete Steiner triple systems with applications to loop theory
• Embedding in a perfect code
• On the admissible families of components of hamming codes

This page was built for publication: Embedding in \(q\)-ary 1-perfect codes and partitions