Perfect binary \((n,3)\) codes: The structure of graphs of minimum distances
From MaRDI portal
Publication:5954078
DOI10.1016/S0166-218X(00)00356-5zbMath1002.94536MaRDI QIDQ5954078
Publication date: 30 January 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00356-5
Related Items
Transitive nonpropelinear perfect codes, On components of the Kerdock codes and the dual of the BCH code \(C_{1, 3}\), Perfect codes as isomorphic spaces, On the minimum distance graph of an extended Preparata code
Cites Work