Polynomial factorisation and an application to regular directed graphs
From MaRDI portal
Publication:1273209
DOI10.1006/ffta.1998.0219zbMath0957.11049OpenAlexW2039928872MaRDI QIDQ1273209
Publication date: 9 March 1999
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/ffta.1998.0219
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Polynomials over finite fields (11T06) Directed graphs (digraphs), tournaments (05C20)
Related Items
Energy bounds, bilinear forms and their applications in function fields, Algebraic Cayley graphs over finite fields, A new sieve for distinct coordinate counting, Explicit factorization of \(X^{2^m}p^n-1\) over a finite field, On some subgroups of the multiplicative group of finite rings, Polynomial distribution and sequences of irreducible polynomials over finite fields, Cayley Graphs Generated by Small Degree Polynomials over Finite Fields
Cites Work
- The length of primitive BCH codes with minimal covering radius
- Algebraic function fields and codes
- Factoring polynomials in finite fields: An application of Lang-Weil to a problem in graph theory
- Permutation polynomials and primitive permutation groups
- Exceptional polynomials of affine type
- On a conjecture of Schur
- On curves with separated variables
- Coverings of Algebraic Curves
- Diameters and Eigenvalues
- Uniform Distribution of Polynomials Over Finite Fields
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item