Pages that link to "Item:Q2025113"
From MaRDI portal
The following pages link to Minimal linear codes arising from blocking sets (Q2025113):
Displaying 26 items.
- Wide minimal binary linear codes from the general Maiorana-Mcfarland class (Q2035453) (← links)
- A geometric characterization of minimal codes and their asymptotic performance (Q2070261) (← links)
- An inductive construction of minimal codes (Q2119851) (← links)
- Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound (Q2120998) (← links)
- On cutting blocking sets and their codes (Q2121527) (← links)
- Minimal linear codes from weakly regular bent functions (Q2130052) (← 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)
- Constructing saturating sets in projective spaces using subgeometries (Q2168075) (← links)
- Linear cutting blocking sets and minimal codes in the rank metric (Q2169825) (← links)
- Several families of \(q\)-ary minimal linear codes with \(w_{\min}/w_{\max} \leq (q-1)/q\) (Q2174584) (← 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)
- Minimal trellises for block codes (Q3816021) (← links)
- Three Combinatorial Perspectives on Minimal Codes (Q5062110) (← links)
- Small Strong Blocking Sets by Concatenation (Q5883273) (← links)
- On the lower bound for the length of minimal codes (Q6080135) (← links)
- Minimal codewords arising from the incidence of points and hyperplanes in projective spaces (Q6112222) (← links)
- On the minimum number of minimal codewords (Q6112238) (← links)
- Saturating systems and the rank-metric covering radius (Q6185345) (← links)
- Infinite families of minimal binary codes via Krawtchouk polynomials (Q6544459) (← links)
- Minimal linear codes constructed from partial spreads (Q6571309) (← links)
- Strong blocking sets and minimal codes from expander graphs (Q6571606) (← links)
- Minimal linear codes constructed from hierarchical posets with two levels (Q6646802) (← links)
