The following pages link to (Q4990142):
Displaying 6 items.
- Optimum distance flag codes from spreads via perfect matchings in graphs (Q825551) (← links)
- Edge local complementation and equivalence of binary linear codes (Q1009082) (← links)
- On the number of minimal codewords in codes generated by the adjacency matrix of a graph (Q2065789) (← links)
- New distance concept and graph theory approach for certain coding techniques design and analysis (Q2325893) (← links)
- (Q4242209) (← links)
- A new formula for the minimum distance of an expander code (Q5884135) (← links)