Difference sets and three-weight linear codes from trinomials

DOI10.1016/J.FFA.2023.102195MaRDI QIDQ6156905zbMATHOpenAlexFDO

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

zbMATH Keywords

difference setscurves over finite fieldsthree-weight linear codes

Mathematics Subject Classification ID

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)

Abstract: We confirm a conjecture of Cun Sheng Ding~cite{Ding-Discrete} claiming that the punctured value-sets of a list of eleven trinomials over odd-degree extensions of the binary field give rise to difference sets with Singer parameters. In the course of confirming the conjecture, we show that these trinomials share the remarkable property that every element of the value-set of each trinomial has either one or four preimages. We also give a partial resolution of another conjecture of Cun Sheng Ding~cite{Ding-Discrete} claiming that linear codes constructed from those eleven trinomials are tri-weight.

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

Cites work

• scientific article; zbMATH DE number 3842614 (Why is no real title available?)
• scientific article; zbMATH DE number 1016456 (Why is no real title available?)
• scientific article; zbMATH DE number 1390143 (Why is no real title available?)
• A construction of binary linear codes from Boolean functions
• An analog to the discriminant over fields of characteristic two
• Cyclotomic Linear Codes of Order $3$
• Difference sets and hyperovals
• Linear Codes From Some 2-Designs
• New cyclic difference sets with Singer parameters
• On \(x^{q+1}+ax+b\)
• On the equation \(x^{2^l+1}+x+a=0\) over \(\mathrm{GF}(2^k)\)
• 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}}\)
• Power moment identities on weight distributions in error correcting codes
• Two-Weight Codes Punctured from Irreducible Cyclic Codes
• \(X^{2^l+1}+x+a\) and related affine polynomials over \(\mathrm{GF}(2^k\))

Cited in

(2)

• Multiplicative difference sets via additive characters
• Three-weight ternary linear codes from a family of cyclic difference sets

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)