On full-rank perfect codes over finite fields

DOI10.1134/S1990478916030157zbMath1374.94855arXiv1310.1174MaRDI QIDQ2959188

Alexander Mikhailovich Romanov

Publication date: 9 February 2017

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

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

zbMATH Keywords

Hamming codefull-rank codei-componentnonlinear perfect code

Mathematics Subject Classification ID

Other types of codes (94B60) Combinatorial codes (94B25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamiltonicity of minimum distance graphs of 1-perfect codes
• Ranks of \(q\)-ary 1-perfect codes
• On the structure of non-full-rank perfect \(q\)-ary codes
• Construction of perfect \(q\)-ary codes by sequential switchings of \(\tilde\alpha\)-components
• Kernels and \(p\)-kernels of \(p^r\)-ary 1-perfect codes.
• Embedding in a perfect code
• Perfect binary codes: constructions, properties, and enumeration
• Nonequivalent q-Ary Perfect Codes
• On the admissible families of components of hamming codes
• The Perfect Binary One-Error-Correcting Codes of Length 15: Part II—Properties
• On linear and nonlinear single-error-correcting q-nary perfect codes
• On Group and Nongroup Perfect Codes in $q$ Symbols.

This page was built for publication: On full-rank perfect codes over finite fields