Ranks of \(q\)-ary 1-perfect codes
From MaRDI portal
Publication:697638
DOI10.1023/A:1016510804974zbMath1012.94019OpenAlexW1553529714MaRDI QIDQ697638
Kevin T. Phelps, Mercè Villanueva
Publication date: 17 September 2002
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1016510804974
Related Items
On the number of \(q\)-ary quasi-perfect codes with covering radius 2 ⋮ On non-full-rank perfect codes over finite fields ⋮ An enumeration of 1-perfect ternary codes ⋮ Projective tilings and full-rank perfect codes ⋮ On perfect 2-colorings of the \(q\)-ary \(n\)-cube ⋮ On full-rank perfect codes over finite fields ⋮ On the embedding of constant-weight codes into perfect codes ⋮ Construction of perfect \(q\)-ary codes by switchings of simple components ⋮ On perfect \(p\)-ary codes of length \(p+1\) ⋮ Kernels and \(p\)-kernels of \(p^r\)-ary 1-perfect codes. ⋮ Embedding in \(q\)-ary 1-perfect codes and partitions
