Pages that link to "Item:Q4975884"

The following pages link to Reconstructing Extended Perfect Binary One-Error-Correcting Codes From Their Minimum Distance Graphs (Q4975884):

Displayed 6 items.

• Computational complexity of reconstruction and isomorphism testing for designs and line graphs (Q618291) ‎ (← links)
• On weak isometries of preparata codes (Q734303) ‎ (← links)
• On explicit minimum weight bases for extended cyclic codes related to Gold functions (Q1791673) ‎ (← links)
• Minimum weight bases for quaternary Reed-Muller codes (Q2058343) ‎ (← links)
• On extending propelinear structures of the Nordstrom-Robinson code to the Hamming code (Q2364475) ‎ (← links)
• On the minimum distance graph of an extended Preparata code (Q2638424) ‎ (← links)