On the admissible families of components of Hamming codes

DOI10.1134/S1990478912030106MaRDI QIDQ5263768zbMATHOpenAlexFDO

Authors A. M. Romanov

Publication date 17 July 2015

Published in Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

binary codeHamming code\(q\)-ary code1-perfect code\(i\)-component

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Abstract: In this paper, we describe the properties of the $i$-components of Hamming codes. We suggest constructions of the admissible families of components of Hamming codes. It is shown that every $q$-ary code of length $m$ and minimum distance 5 (for $q=3$ the minimum distance is 3) can be embedded in a $q$-ary 1-perfect code of length $n=(q^m-1)/(q-1)$. It is also shown that every binary code of length $m+k$ and minimum distance $3k+3$ can be embedded in a binary 1-perfect code of length $n=2^m-1$.

Recommendations

• scientific article; zbMATH DE number 2239556
• scientific article; zbMATH DE number 1882354
• Embedding in a perfect code
• Small weight bases for Hamming codes
• On a lower bound on the number of perfect binary codes

Cited in

(4)

• On the embedding of constant-weight codes into perfect codes
• On full-rank perfect codes over finite fields
• Embedding in \(q\)-ary 1-perfect codes and partitions
• Small weight bases for hamming codes

This page was built for publication: On the admissible families of components of Hamming codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5263768)