Pages that link to "Item:Q5062110"
From MaRDI portal
The following pages link to Three Combinatorial Perspectives on Minimal Codes (Q5062110):
Displaying 11 items.
- Higgledy-piggledy sets in projective spaces of small dimension (Q2161220) (← links)
- Linear cutting blocking sets and minimal codes in the rank metric (Q2169825) (← links)
- Small Strong Blocking Sets by Concatenation (Q5883273) (← links)
- On the lower bound for the length of minimal codes (Q6080135) (← links)
- Minimal codewords in norm-trace codes (Q6122425) (← links)
- Saturating systems and the rank-metric covering radius (Q6185345) (← links)
- Covering grids with multiplicity (Q6204684) (← links)
- Minimal linear codes constructed from partial spreads (Q6571309) (← links)
- Strong blocking sets and minimal codes from expander graphs (Q6571606) (← links)
- Minimal linear codes derived from weakly regular bent and plateaued functions (Q6580114) (← links)
- Minimal linear codes constructed from hierarchical posets with two levels (Q6646802) (← links)
