Back to Search
Start Over
Upper bound on the number of inequivalent extended binary irreducible Goppa codes.
- Source :
-
Discrete Mathematics . Jan2024, Vol. 347 Issue 1, pN.PAG-N.PAG. 1p. - Publication Year :
- 2024
-
Abstract
- In this paper, we always assume that p and n > 3 are two distinct odd primes, m ≥ 2 is a positive integer, and gcd (p m , 2 n (2 2 n − 1)) ≠ 1. Set r = p 2 or r = p 3 , we determine upper bounds on the number of inequivalent extended binary irreducible Goppa codes Γ (L , g) of degree r and length 2 n + 1 , where L = F 2 n ∪ { ∞ } is the support set and each g (x) is an irreducible polynomial of degree r over F 2 n . [ABSTRACT FROM AUTHOR]
- Subjects :
- *IRREDUCIBLE polynomials
*BINARY codes
*INTEGERS
Subjects
Details
- Language :
- English
- ISSN :
- 0012365X
- Volume :
- 347
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 173154777
- Full Text :
- https://doi.org/10.1016/j.disc.2023.113703