Reconstructing Extended Perfect Binary One-Error-Correcting Codes From Their Minimum Distance Graphs
From MaRDI portal
Publication:4975884
DOI10.1109/TIT.2009.2018338zbMath1367.94407arXiv0810.5633OpenAlexW2134472055MaRDI QIDQ4975884
Olli Pottonen, Patric R. J. Östergård, Faina I. Solov'eva, Ivan Yu. Mogilnykh
Publication date: 8 August 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0810.5633
Related Items (6)
On extending propelinear structures of the Nordstrom-Robinson code to the Hamming code ⋮ On the minimum distance graph of an extended Preparata code ⋮ Computational complexity of reconstruction and isomorphism testing for designs and line graphs ⋮ On explicit minimum weight bases for extended cyclic codes related to Gold functions ⋮ On weak isometries of preparata codes ⋮ Minimum weight bases for quaternary Reed-Muller codes
This page was built for publication: Reconstructing Extended Perfect Binary One-Error-Correcting Codes From Their Minimum Distance Graphs