Pages that link to "Item:Q2070261"
From MaRDI portal
The following pages link to A geometric characterization of minimal codes and their asymptotic performance (Q2070261):
Displaying 13 items.
- Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound (Q2120998) (← links)
- On cutting blocking sets and their codes (Q2121527) (← links)
- Minimal binary linear codes: a general framework based on bent concatenation (Q2132451) (← links)
- Minimal linear codes constructed from functions (Q2154886) (← links)
- Higgledy-piggledy sets in projective spaces of small dimension (Q2161220) (← links)
- Linear cutting blocking sets and minimal codes in the rank metric (Q2169825) (← links)
- On the weight distribution of some minimal codes (Q2657132) (← links)
- Some hypersurfaces over finite fields, minimal codes and secret sharing schemes (Q2672305) (← links)
- Minimal linear codes from Hermitian varieties and quadrics (Q2689914) (← links)
- Several classes of new weakly regular bent functions outside \(\mathcal{RF}\), their duals and some related (minimal) codes with few weights (Q6045527) (← links)
- On the lower bound for the length of minimal codes (Q6080135) (← links)
- On the minimum number of minimal codewords (Q6112238) (← links)
- Saturating systems and the rank-metric covering radius (Q6185345) (← links)
