Pages that link to "Item:Q502405"

The following pages link to Linear codes with few weights from weakly regular bent functions based on a generic construction (Q502405):

Displaying 49 items.

• A construction of codes with linearity from two linear codes (Q502404) (← links)
• A class of linear codes with a few weights (Q502407) (← links)
• Linear codes with few weights from inhomogeneous quadratic functions (Q521872) (← links)
• Four decades of research on bent functions (Q908040) (← links)
• Two classes of linear codes and their weight distributions (Q1647743) (← links)
• Linear codes from weakly regular plateaued functions and their secret sharing schemes (Q1727361) (← 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)
• A construction of \(p\)-ary linear codes with two or three weights (Q2025343) (← 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)
• 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)
• A geometric characterization of minimal codes and their asymptotic performance (Q2070261) (← links)
• Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound (Q2120998) (← links)
• Secret sharing schemes based on the dual of Golay codes (Q2121024) (← links)
• Minimal linear codes from weakly regular bent functions (Q2130052) (← links)
• Minimal binary linear codes: a general framework based on bent concatenation (Q2132451) (← links)
• A survey on \(p\)-ary and generalized bent functions (Q2154880) (← links)
• Minimal linear codes constructed from functions (Q2154886) (← links)
• Constructions of projective linear codes by the intersection and difference of sets (Q2168950) (← links)
• Minimal linear codes from Maiorana-McFarland functions (Q2191823) (← links)
• On generalized hyper-bent functions (Q2202891) (← links)
• A family of distance-optimal minimal linear codes with flexible parameters (Q2202899) (← links)
• Optimal minimal linear codes from posets (Q2211330) (← links)
• Minimal linear codes from weakly regular plateaued balanced functions (Q2222925) (← links)
• Several classes of linear codes with few weights from the closed butterfly structure (Q2238931) (← links)
• New linear codes with few weights derived from Kloosterman sums (Q2302568) (← links)
• A construction of \(q\)-ary linear codes with irreducible cyclic codes (Q2414935) (← links)
• A survey on the applications of Niho exponents (Q2632844) (← links)
• Further projective binary linear codes derived from two-to-one functions and their duals (Q2692949) (← links)
• Three Combinatorial Perspectives on Minimal Codes (Q5062110) (← links)
• Construction of minimal linear codes with few weights from weakly regular plateaued functions (Q5102141) (← links)
• Constructions of linear codes with two or three weights from vectorial dual-bent functions (Q6041565) (← links)
• Several classes of new weakly regular bent functions outside \(\mathcal{RF}\), their duals and some related (minimal) codes with few weights (Q6045527) (← links)
• Vectorial bent functions and linear codes from quadratic forms (Q6086199) (← links)
• Infinite families of \(t\)-designs and strongly regular graphs from punctured codes (Q6112185) (← links)
• Generalized Hamming weights of linear codes from cryptographic functions (Q6112192) (← links)
• Some shortened codes from linear codes constructed by defining sets (Q6112207) (← links)
• Connection of \(p\)-ary \(t\)-weight linear codes to Ramanujan Cayley graphs with \(t+1\) eigenvalues (Q6112241) (← links)
• Codes and pseudo-geometric designs from the ternary \(m\)-sequences with Welch-type decimation \(d = 2 \cdot 3^{(n -1)/2} + 1\) (Q6144448) (← links)
• Some 3-designs and shortened codes from binary cyclic codes with three zeros (Q6156911) (← links)
• Some subfield codes from MDS codes (Q6167298) (← links)
• A class of three-weight linear codes over finite fields of odd characteristic (Q6489326) (← links)
• Minimal linear codes derived from weakly regular bent and plateaued functions (Q6580114) (← links)
• Characterization of weakly regular \(p\)-ary bent functions of \(\ell \)-form (Q6618608) (← links)
• Combinatorial \(t\)-designs and strongly regular graphs from projective codes over finite fields (Q6631960) (← links)
• Additive codes with few weights (Q6643247) (← links)