Skip to content
AI Atlas
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, coloured by entity type. Click a node to open it.

3 nodes · 2 edges

Laying out 3 nodes…

Direct relations, as a list

Authors 2
ResearcherShenghao YangResearcherYanyan Dong
A machine-checked proof of the Dong-Yang classification of optimal (n,4) binary codes for BSCs — relationship graph | AI Atlas