Factorization of invariant polynomials under actions of projective linear groups and its applications in coding theory
From MaRDI portal
Publication:6542660
DOI10.1007/S12095-023-00675-XzbMATH Open1546.94131MaRDI QIDQ6542660
Publication date: 22 May 2024
Published in: Cryptography and Communications (Search for Journal in Brave)
polynomial factorizationinvariant polynomialgroup action on irreducible polynomialsextended Goppa codesparity-check subcodes of Goppa codes
Cites Work
- Title not available (Why is that?)
- On the action of \(\text{GL}_2(\mathbb F_q)\) on irreducible polynomials over \(\mathbb F_q\)
- On \(x^{q+1}+ax+b\)
- Factorization of a class of polynomials over finite fields
- On different families of invariant irreducible polynomials over \(\mathbb F_2\)
- Note on cubics over \(GF(2^n)\) and \(GF(3^n)\)
- Binary quasi-cyclic Goppa codes
- On the cyclicity of Goppa codes, parity-check subcodes of Goppa codes, and extended Goppa codes
- A characterization of linearized polynomials with maximum kernel
- Solving \(X^{q+1}+X+a=0\) over finite fields
- Complete solution over \(\mathbb{F}_{p^n}\) of the equation \(X^{p^k+1}+X+a=0\)
- On the construction of irreducible self-reciprocal polynomials over finite fields
- Solving \(x^{2^k + 1} + x + a = 0\) in \(\mathbb{F}_{2^n}\) with \(\gcd(n, k) = 1\)
- \(X^{2^l+1}+x+a\) and related affine polynomials over \(\mathrm{GF}(2^k\))
- On the multiplicative order of the roots of \(bX^{q^r + 1} - aX^{q^r} + dX - c\)
- A characterization of the number of roots of linearized and projective polynomials in the field of coefficients
- On a class of quadratic polynomials with no zeros and its application to APN functions
- On the equation \(x^{2^l+1}+x+a=0\) over \(\mathrm{GF}(2^k)\)
- Goppa and related codes invariant under a prescribed permutation
- Folding Alternant and Goppa Codes With Non-Trivial Automorphism Groups
- Monoidic Codes in Cryptography
- Collineation Groups of Non-Desarguesian Planes, I: The Hall Veblen-Wedderburn Systems
- Compact McEliece Keys from Goppa Codes
- ON NORMAL BASES OF A FINITE FIELD
- Normal and Self-Dual Normal Bases from Factorization of $cx^{q + 1} + dx^q - ax - b$
- Compact McEliece keys based on quasi-dyadic Srivastava codes
- On the solution of algebraic equations over finite fields
- Construction of Expurgated and Extended Goppa Codes With Dihedral Automorphism Groups
This page was built for publication: Factorization of invariant polynomials under actions of projective linear groups and its applications in coding theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6542660)