Pages that link to "Item:Q3005590"
From MaRDI portal
The following pages link to The Minimum Distance of Graph Codes (Q3005590):
Displaying 8 items.
- Optimum distance flag codes from spreads via perfect matchings in graphs (Q825551) (← 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)
- The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes (Q2341750) (← links)
- Optimal codes as Tanner codes with cyclic component codes (Q2350924) (← links)
- On the sizes of expander graphs and minimum distances of graph codes (Q2449138) (← links)
- (Q4242209) (← links)
- A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem (Q5892431) (← links)