scientific article; zbMATH DE number 1285452
From MaRDI portal
Publication:4242209
zbMATH Open0913.94021MaRDI QIDQ4242209FDOQ4242209
Authors: Sergey Avgustinovich 
Publication date: 10 May 1999
Title of this publication is not available (Why is that?)
Recommendations
- Perfect binary \((n,3)\) codes: The structure of graphs of minimum distances
- Graph theoretic aspects of minimum distance and equivalence of binary linear codes
- The minimum distance of graph codes
- On the stabilizers of the minimum-weight codewords of some binary codes from graphs on triples
- On the minimum distance graph of an extended Preparata code
- On binary cyclic codes with minimum distance \(d=3\).
- Bounds on the minimum code distance for nonbinary codes based on bipartite graphs
- Hamiltonicity of minimum distance graphs of 1-perfect codes
- Binary codes from graphs on triples and permutation decoding
- Reconstructing Extended Perfect Binary One-Error-Correcting Codes From Their Minimum Distance Graphs
Cited In (9)
- Extremal 1-codes in distance-regular graphs of diameter 3
- Title not available (Why is that?)
- Title not available (Why is that?)
- On weak isometries of preparata codes
- On extending propelinear structures of the Nordstrom-Robinson code to the Hamming code
- Title not available (Why is that?)
- STS-graphical invariant for perfect codes
- On perfect binary codes
- On the minimum distance graph of an extended Preparata code
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4242209)
