Pages that link to "Item:Q2976952"
From MaRDI portal
The following pages link to Linear Codes With Two or Three Weights From Weakly Regular Bent Functions (Q2976952):
Displaying 50 items.
- A construction of codes with linearity from two linear codes (Q502404) (← links)
- Linear codes with few weights from weakly regular bent functions based on a generic construction (Q502405) (← links)
- A class of linear codes with a few weights (Q502407) (← links)
- Two classes of \(p\)-ary bent functions and linear codes with three or four weights (Q502408) (← links)
- A class of three-weight linear codes and their complete weight enumerators (Q502409) (← links)
- Three classes of binary linear codes with good parameters (Q505659) (← links)
- A class of hyper-bent functions and Kloosterman sums (Q520081) (← links)
- Linear codes with few weights from inhomogeneous quadratic functions (Q521872) (← links)
- Evaluation of the Hamming weights of a class of linear codes based on Gauss sums (Q522205) (← links)
- Linear codes from quadratic forms (Q681333) (← links)
- Weight enumerators of a class of linear codes (Q683913) (← links)
- Four decades of research on bent functions (Q908040) (← links)
- Three-weight codes and near-bent functions from two-weight codes (Q1633168) (← links)
- Two classes of linear codes and their weight distributions (Q1647743) (← links)
- Complete weight enumerators of three classes of linear codes (Q1667450) (← links)
- Five classes of optimal two-weight linear codes (Q1667452) (← links)
- Complete weight enumerators of a class of linear codes with two weights (Q1686011) (← links)
- Binary linear codes with two or three weights from Niho exponents (Q1696138) (← links)
- Some two-weight and three-weight linear codes (Q1726025) (← links)
- Linear codes from weakly regular plateaued functions and their secret sharing schemes (Q1727361) (← links)
- A link between combinatorial designs and three-weight linear codes (Q1741922) (← links)
- Several infinite families of \(p\)-ary weakly regular bent functions (Q1783727) (← links)
- Complete weight enumerators for several classes of two-weight and three-weight linear codes (Q1979962) (← links)
- Projective binary linear codes from special Boolean functions (Q1983338) (← links)
- More constructions of 3-weight linear codes (Q1983404) (← links)
- Linear codes from vectorial Boolean power functions (Q1994938) (← links)
- A class of two or three weights linear codes and their complete weight enumerators (Q2022138) (← links)
- A construction of \(p\)-ary linear codes with two or three weights (Q2025343) (← links)
- Construction of minimal linear codes from multi-variable functions (Q2025361) (← links)
- Two classes of near-optimal codebooks with respect to the Welch bound (Q2025366) (← links)
- Wide minimal binary linear codes from the general Maiorana-Mcfarland class (Q2035453) (← links)
- Recent results and problems on constructions of linear codes from cryptographic functions (Q2040307) (← links)
- Two families of subfield codes with a few weights (Q2040337) (← links)
- A family of projective two-weight linear codes (Q2043420) (← links)
- Binary linear codes with few weights from Boolean functions (Q2043421) (← links)
- Characterization of \(p\)-ary functions in terms of association schemes and its applications (Q2068615) (← links)
- Infinite families of optimal linear codes and their applications to distributed storage systems (Q2103140) (← links)
- Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound (Q2120998) (← links)
- Minimal linear codes from weakly regular bent functions (Q2130052) (← links)
- Minimal linear codes constructed from functions (Q2154886) (← links)
- Constructions of projective linear codes by the intersection and difference of sets (Q2168950) (← links)
- Linear codes with few weights from cyclotomic classes and weakly regular bent functions (Q2182084) (← links)
- Minimal linear codes from Maiorana-McFarland functions (Q2191823) (← links)
- A note on the minimal binary linear code (Q2202884) (← links)
- On generalized hyper-bent functions (Q2202891) (← links)
- A family of distance-optimal minimal linear codes with flexible parameters (Q2202899) (← links)
- Minimal linear codes from weakly regular plateaued balanced functions (Q2222925) (← links)
- Linear codes with few weights from weakly regular plateaued functions (Q2231712) (← links)
- Four classes of minimal binary linear codes with \(w_{\mathrm{min}}/w_{\mathrm{max}}<1/2\) derived from Boolean functions (Q2291661) (← links)
- Ramanujan graphs and expander families constructed from \(p\)-ary bent functions (Q2291671) (← links)
