Pages that link to "Item:Q2404399"
From MaRDI portal
The following pages link to Binary linear codes from vectorial Boolean functions and their weight distribution (Q2404399):
Displaying 18 items.
- A construction of binary linear codes from Boolean functions (Q297928) (← links)
- Bent vectorial functions and linear codes from o-polynomials (Q499659) (← links)
- Proofs of several conjectures on linear codes from Boolean functions (Q1625821) (← links)
- The subfield codes of hyperoval and conic codes (Q1734678) (← links)
- Projective binary linear codes from special Boolean functions (Q1983338) (← links)
- Linear codes from vectorial Boolean power functions (Q1994938) (← links)
- Recent results and problems on constructions of linear codes from cryptographic functions (Q2040307) (← links)
- Binary linear codes with few weights from Boolean functions (Q2043421) (← links)
- Minimal binary linear codes: a general framework based on bent concatenation (Q2132451) (← links)
- A note on the minimal binary linear code (Q2202884) (← links)
- Four classes of minimal binary linear codes with \(w_{\mathrm{min}}/w_{\mathrm{max}}<1/2\) derived from Boolean functions (Q2291661) (← links)
- Further projective binary linear codes derived from two-to-one functions and their duals (Q2692949) (← links)
- (Q4352790) (← links)
- (Q4863444) (← links)
- Constructions of linear codes with two or three weights from vectorial dual-bent functions (Q6041565) (← links)
- Vectorial bent functions and linear codes from quadratic forms (Q6086199) (← links)
- Expressing the minimum distance, weight distribution and covering radius of codes by means of the algebraic and numerical normal forms of their indicators (Q6112180) (← links)
- Additive codes with few weights (Q6643247) (← links)
