Pages that link to "Item:Q297928"

The following pages link to A construction of binary linear codes from Boolean functions (Q297928):

Displaying 30 items.

• A survey on the applications of Niho exponents (Q2632844) (← links)
• The parameters of minimal linear codes (Q2662039) (← links)
• Constructing few-weight linear codes and strongly regular graphs (Q2675859) (← links)
• Bounds for the sum of distances of spherical sets of small size (Q2689513) (← links)
• Further projective binary linear codes derived from two-to-one functions and their duals (Q2692949) (← links)
• Construction of minimal linear codes with few weights from weakly regular plateaued functions (Q5102141) (← links)
• (Q5692018) (← 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)
• 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)
• Möbius transformations and characterizations of hyper-bent functions from Dillon-like exponents with coefficients in extension fields (Q6112181) (← links)
• Generalized Hamming weights of linear codes from cryptographic functions (Q6112192) (← links)
• Some shortened codes from linear codes constructed by defining sets (Q6112207) (← links)
• Several classes of \(p\)-ary linear codes with few weights (Q6115443) (← 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)
• Difference sets and three-weight linear codes from trinomials (Q6156905) (← links)
• Some 3-designs and shortened codes from binary cyclic codes with three zeros (Q6156911) (← links)
• Two classes of 2-weight and 3-weight linear codes in terms of Kloosterman sums (Q6159448) (← links)
• Some subfield codes from MDS codes (Q6167298) (← links)
• Constructions of strongly regular Cayley graphs derived from weakly regular bent functions (Q6204333) (← links)
• A class of three-weight linear codes over finite fields of odd characteristic (Q6489326) (← links)
• Dual transform and projective self-dual codes (Q6548437) (← links)
• New results on \(n\)-to-1 mappings over finite fields (Q6597214) (← links)
• New dimension-independent upper bounds on linear insdel codes (Q6605877) (← links)
• On the size of maximal binary codes with 2, 3, and 4 distances (Q6615496) (← links)
• Few-weight linear codes over \(\mathbb{F}_p\) from \(t\)-to-one mappings (Q6631501) (← links)
• Additive codes with few weights (Q6643247) (← links)
• Minimal linear codes constructed from hierarchical posets with two levels (Q6646802) (← links)
• Constructions of plateaued correctors with high correction order and good nonlinearity via Walsh spectral neutralization technique (Q6651931) (← links)