Reconstructing Extended Perfect Binary One-Error-Correcting Codes From Their Minimum Distance Graphs

Journal

IEEE Transactions on Information Theory
ISSN: 0018-9448 , E-ISSN: 1557-9654

Output data

Year: 2009, Volume: 55, Number: 6, Pages: 2622-2625 Pages count : 4 DOI: 10.1109/tit.2009.2018338

Authors

Mogilnykh Ivan Yu. ^1,4 , Ostergard Patric R.J. ² , Pottonen Olli ^2,3 , Solov'eva Faina I. ¹

Affiliations

1	Sobolev Institute of Mathematics
2	Department of Communications and Networking Aalto University Aalto, Finland
3	Departament de Llenguatges i Sistemes Informàtics Universitat Politècnica de Catalunya Barcelona, Spain
4	Novosibirsk State University

Mogilnykh I.Y. , Ostergard P.R.J. , Pottonen O. , Solov'eva F.I.
Reconstructing Extended Perfect Binary One-Error-Correcting Codes From Their Minimum Distance Graphs
IEEE Transactions on Information Theory. 2009. V.55. N6. P.2622-2625. DOI: 10.1109/tit.2009.2018338 WOS Scopus РИНЦ OpenAlex