Difference sets and three-weight linear codes from trinomials
DOI10.1016/J.FFA.2023.102195zbMATH Open1519.94231arXiv2108.10042OpenAlexW4364381234MaRDI QIDQ6156905FDOQ6156905
Authors: Omran Ahmadi, Masoud Shafaeiabr
Publication date: 19 June 2023
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.10042
Recommendations
- Three-weight ternary linear codes from a family of cyclic difference sets
- On binary cyclic codes with codewords of weight three and binary sequences with the trinomial property
- A construction of several classes of two-weight and three-weight linear codes
- All \(s\)-sum sets of type 2 or 3 are triple-sum sets
- On triple-sum-sets and two or three weights codes
Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)
Cites Work
- On the function field sieve and the impact of higher splitting probabilities. Application to discrete logarithms in \(\mathbb{F}_{2^{1971}}\) and \(\mathbb{F}_{2^{3164}}\)
- Title not available (Why is that?)
- On \(x^{q+1}+ax+b\)
- New cyclic difference sets with Singer parameters
- Title not available (Why is that?)
- Linear Codes From Some 2-Designs
- A construction of binary linear codes from Boolean functions
- Title not available (Why is that?)
- Cyclotomic Linear Codes of Order $3$
- Two-Weight Codes Punctured from Irreducible Cyclic Codes
- Power moment identities on weight distributions in error correcting codes
- \(X^{2^l+1}+x+a\) and related affine polynomials over \(\mathrm{GF}(2^k\))
- On the equation \(x^{2^l+1}+x+a=0\) over \(\mathrm{GF}(2^k)\)
- Difference sets and hyperovals
- An analog to the discriminant over fields of characteristic two
Cited In (2)
This page was built for publication: Difference sets and three-weight linear codes from trinomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6156905)