The following pages link to Codes from Difference Sets (Q3190550):
Displaying 21 items.
- Complete weight enumerators of some linear codes and their applications (Q306065) (← links)
- A construction of codes with linearity from two linear codes (Q502404) (← links)
- Weight enumerators of a class of linear codes (Q683913) (← links)
- Gauss sums, Jacobi sums, and \(p\)-ranks of cyclic difference sets (Q1296754) (← links)
- Construction of de Bruijn sequences from product of two irreducible polynomials (Q1696134) (← links)
- New constructions of approximately SIC-POVMs via difference sets (Q1744271) (← links)
- Good polynomials for optimal LRC of low locality (Q2035459) (← links)
- Characterizations and constructions of \(n\)-to-1 mappings over finite fields (Q2101185) (← links)
- Cubic bent functions outside the completed Maiorana-McFarland class (Q2200508) (← links)
- New constructions of asymptotically optimal codebooks via cyclotomic classes of order 8 (Q2298923) (← links)
- A construction of several classes of two-weight and three-weight linear codes (Q2397157) (← links)
- Gaussian sums, hyper Eisenstein sums and Jacobi sums over a local ring and their applications (Q2689915) (← links)
- (Q4793308) (← links)
- Linear codes from vectorial Boolean functions in the context of algebraic attacks (Q5013480) (← links)
- Complete weight enumerators of a class of linear codes (Q5965789) (← links)
- A stability result for girth‐regular graphs with even girth (Q6057588) (← links)
- Three new constructions of optimal linear codes with few weights (Q6082262) (← links)
- Further investigations on permutation based constructions of bent functions (Q6111265) (← links)
- Twin prime difference set and its application on a coded mask (Q6132889) (← links)
- New constructions of signed difference sets (Q6587207) (← links)
- New results on \(n\)-to-1 mappings over finite fields (Q6597214) (← links)
