On the ranks and kernels problem for perfect codes
From MaRDI portal
Publication:2388457
DOI10.1023/B:PRIT.0000011272.10614.8czbMath1154.94482OpenAlexW1998811014MaRDI QIDQ2388457
Olof Heden, Sergei V. Avgustinovich, Faina I. Solov'eva
Publication date: 14 September 2005
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:prit.0000011272.10614.8c
Related Items
On the classification of perfect codes: side class structures ⋮ An enumeration of 1-perfect ternary codes ⋮ Projective tilings and full-rank perfect codes ⋮ Mollard code as a robust nonlinear code ⋮ On perfect binary codes ⋮ Embedding in a perfect code ⋮ A remark on full rank perfect codes ⋮ Perfect codes from the dual point of view. I ⋮ Full rank perfect codes and \(\alpha \)-kernels ⋮ On rank and kernel of some mixed perfect codes ⋮ On the classification of perfect codes: extended side class structures
