On the structure of non-full-rank perfect q-ary codes

DOI10.3934/AMC.2011.5.149MaRDI QIDQ2275868zbMATH OpenOpenAlexFDO

Authors Olof Heden, Denis S. Krotov

Publication date 10 August 2011

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

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

zbMATH Keywords

\(q\)-ary codesperfect codes

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Abstract: The Krotov combining construction of perfect 1-error-correcting binary codes from 2000 and a theorem of Heden saying that every non-full-rank perfect 1-error-correcting binary code can be constructed by this combining construction is generalized to the $q$-ary case. Simply, every non-full-rank perfect code $C$ is the union of a well-defined family of $mu$-components $K_{m}u$, where $mu$ belongs to an "outer" perfect code $C^{\ast }$, and these components are at distance three from each other. Components from distinct codes can thus freely be combined to obtain new perfect codes. The Phelps general product construction of perfect binary code from 1984 is generalized to obtain $mu$-components, and new lower bounds on the number of perfect 1-error-correcting $q$-ary codes are presented.

Recommendations

• On full-rank perfect codes over finite fields
• On non-full-rank perfect codes over finite fields
• Nonequivalent q-Ary Perfect Codes
• Construction of perfect \(q\)-ary codes by sequential switchings of \(\tilde\alpha\)-components
• Ranks of \(q\)-ary 1-perfect codes

Cited in

(17)

• The extended 1-perfect trades in small hypercubes
• On the size of the symmetry group of a perfect code
• On non-full-rank perfect codes over finite fields
• On full-rank perfect codes over finite fields
• A product construction for perfect codes over arbitrary alphabets (Corresp.)
• On the Kronecker Product Construction of Completely Transitive q-Ary Codes
• Construction of new completely regular q-ary codes from perfect q-ary codes
• A new class of nonlinear \(q\)-ary codes
• A note on the symmetry group of full rank perfect binary codes
• Nonequivalent q-Ary Perfect Codes
• Q-Ary Non-Overlapping Codes: A Generating Function Approach
• Minimum supports of eigenfunctions of Hamming graphs
• Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph
• An enumeration of 1-perfect ternary codes
• On nonlinear 1-quasi-perfect codes and their structural properties
• Ranks of \(q\)-ary 1-perfect codes
• To the theory of \(q\)-ary Steiner and other-type trades

This page was built for publication: On the structure of non-full-rank perfect \(q\)-ary codes

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