Pages that link to "Item:Q259266"
From MaRDI portal
The following pages link to Yet another variation on minimal linear codes (Q259266):
Displaying 13 items.
- Linear codes with few weights from weakly regular bent functions based on a generic construction (Q502405) (← links)
- Minimal linear codes over finite fields (Q1800699) (← links)
- Minimal linear codes arising from blocking sets (Q2025113) (← links)
- Binary linear codes with few weights from Boolean functions (Q2043421) (← links)
- A geometric characterization of minimal codes and their asymptotic performance (Q2070261) (← links)
- An inductive construction of minimal codes (Q2119851) (← links)
- Minimal binary linear codes: a general framework based on bent concatenation (Q2132451) (← links)
- Linear codes with few weights from weakly regular plateaued functions (Q2231712) (← links)
- A linear code based on resilient Boolean maps whose dual is a platform for a robust secret sharing scheme (Q2309688) (← links)
- On the weight distribution of some minimal codes (Q2657132) (← links)
- Constructing few-weight linear codes and strongly regular graphs (Q2675859) (← links)
- Minimal linear codes from Hermitian varieties and quadrics (Q2689914) (← links)
- Strong blocking sets and minimal codes from expander graphs (Q6571606) (← links)