Double-error-correcting cyclic codes and absolutely irreducible polynomials over GF(2)
From MaRDI portal
The paper studies the minimum distance of binary cyclic codes of length \(n = 2^s - 1\) with generator polynomial \(m_1 m_t (x)\) when \(m_i (x)\) is the minimal polynomial of \(\omega^i\) over \(GF(2)\) and \(\omega\) is a primitive element of \(GF (2^s)\). Using Weil's theorem and Bezout's theorem, numerical conditions are derived for the minimum distance of such a code to be greater than 4. A conjecture that would classify all such codes in terms of their minimum distance is formulated.
Recommendations
Cited in
(40)- Plane sections of Fermat surfaces over finite fields
- Exceptional scattered polynomials
- On the minimum distances of non-binary cyclic codes
- On a generalization of planar functions
- On the classification of exceptional scattered polynomials
- Functions which are PN on infinitely many extensions of \(\mathbb F_p\), \(p\) odd
- Some new results on the conjecture on exceptional APN functions and absolutely irreducible polynomials: the Gold case
- On the irreducibility of the hyperplane sections of Fermat varieties in \(\mathbb {P}^{3}\) in characteristic 2. II
- Bounds on the degree of APN polynomials: the case of \(x^{-1} + g(x)\)
- APN monomials over \(\mathrm{GF}(2^n)\) for infinitely many \(n\)
- On the irreducibility of the hyperplane sections of Fermat varieties in \(\mathbb{P}^3\) in characteristic \(2\)
- On trinomials of type \(X^{n+m}(1+AX^{m(q -1)}+BX^{n(q -1)})\), \(n,m\) odd, over \(\mathbb{F}_{q^2}\), \(q=2^{2s+1}\)
- General Error Locator Polynomials for Binary Cyclic Codes With <formula formulatype="inline"><tex>$t \le 2$</tex></formula> and <formula formulatype="inline"> <tex>$n < 63$</tex></formula>
- A new large class of functions not APN infinitely often
- scientific article; zbMATH DE number 503195 (Why is no real title available?)
- On a (145, 32) binary cyclic code
- The state of the art on the conjecture of exceptional APN functions
- The minimum distance of the duals of binary irreducible cyclic codes
- On the classification of exceptional planar functions over \(\mathbb F_p\)
- Planar functions over fields of characteristic two
- scientific article; zbMATH DE number 1867224 (Why is no real title available?)
- On the conjecture on APN functions and absolute irreducibility of polynomials
- A infinite class of Kasami functions that are not APN infinitely often
- On the minimal distance of a polynomial code
- Maximal arcs in projective three-spaces and double-error-correcting cyclic codes
- Absolute irreducibility of polynomials via Newton polytopes
- Polynomials with maximal differential uniformity and the exceptional APN conjecture
- On the exceptionality of rational APN functions
- Some new techniques and progress towards the resolution of the conjecture of exceptional APN functions and absolutely irreducibility of a class of polynomials
- New absolute irreducibility testing criteria and factorization of multivariate polynomials
- Proof of a conjecture on the sequence of exceptional numbers, classifying cyclic codes and APN functions
- Toward resolution of the exceptional \(\mathrm{APN}\) conjecture in the Kasami-Welch degree case
- Proof of a conjecture of Segre and Bartocci on monomial hyperovals in projective planes
- A new absolute irreducibility criterion for multivariate polynomials over finite fields
- Resolution of the exceptional APN conjecture in the Gold degree case
- On 3-dimensional MRD codes of type \(\langle X^{q^t},X+\delta X^{q^{2t}},G(X) \rangle \)
- MRD codes with maximum idealizers
- Asymptotics of Moore exponent sets
- Almost perfect and planar functions
- The weight distributions of cyclic codes with two zeros and zeta functions
This page was built for publication: Double-error-correcting cyclic codes and absolutely irreducible polynomials over \(\text{GF}(2)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1906643)
