Graph explorer Paper
Around A machine-checked proof of the Dong-Yang classification of optimal (n,4) binary codes for BSCs
Every recorded relation of A machine-checked proof of the Dong-Yang classification of optimal (n,4) binary codes for BSCs and of its neighbours, coloured by entity type. Click a node to open it.
0 of the edges connect neighbours to each other (second order).
Direct relations, as a list
- Authors 2
- ResearcherShenghao YangResearcherYanyan Dong