Pages that link to "Item:Q2040307"
From MaRDI portal
The following pages link to Recent results and problems on constructions of linear codes from cryptographic functions (Q2040307):
Displaying 16 items.
- Two-weight or three-weight binary linear codes from cyclotomic mappings (Q2101179) (← 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)
- Weight distributions for projective binary linear codes from Weil sums (Q2130887) (← 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 weakly regular plateaued balanced functions (Q2222925) (← 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)
- Constructions of linear codes with two or three weights from vectorial dual-bent functions (Q6041565) (← links)
- Several classes of linear codes with few weights over finite fields (Q6063257) (← links)
- Generalized Hamming weights of linear codes from cryptographic functions (Q6112192) (← links)
- Some shortened codes from linear codes constructed by defining sets (Q6112207) (← 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)
- The weight hierarchies of linear codes from simplicial complexes (Q6635107) (← links)
