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

DOI10.3934/amc.2011.5.149zbMath1252.94122arXiv1001.0001OpenAlexW1525308658MaRDI QIDQ2275868

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

perfect codes\(q\)-ary codes

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Related Items (9)

On non-full-rank perfect codes over finite fields ⋮ An enumeration of 1-perfect ternary codes ⋮ To the theory of \(q\)-ary Steiner and other-type trades ⋮ On full-rank perfect codes over finite fields ⋮ A note on the symmetry group of full rank perfect binary codes ⋮ Minimum supports of eigenfunctions of Hamming graphs ⋮ The extended 1-perfect trades in small hypercubes ⋮ On the size of the symmetry group of a perfect code ⋮ Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph

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