Enumeration of irreducible and extended irreducible Goppa codes

03/26/2019
by   Kondwani Magamba, et al.
0

We obtain upper bounds on the number of irreducible and extended irreducible Goppa codes over GF(p) of length q and q+1, respectively defined by polynomials of degree r, where q=p^t and r≥ 3 is a positive integer.

READ FULL TEXT
research
02/23/2018

Counting Extended Irreducible Goppa Codes

We obtain an upper bound on the number of extended irreducible q-ary Gop...
research
05/04/2022

Improved error bounds for the distance distribution of Reed-Solomon codes

We use the generating function approach to derive simple expressions for...
research
01/31/2019

Algorithmic counting of nonequivalent compact Huffman codes

It is known that the following five counting problems lead to the same i...
research
04/29/2021

How (Non-)Optimal is the Lexicon?

The mapping of lexical meanings to wordforms is a major feature of natur...
research
04/05/2022

The number of extended irreducible binary Goppa codes

Goppa, in the 1970s, discovered the relation between algebraic geometry ...
research
12/11/2022

Doubly and triply extended MSRD codes

In this work, doubly extended linearized Reed–Solomon codes and triply e...
research
01/09/2018

The DMT classification of real and quaternionic lattice codes

In this paper we consider space-time codes where the code-words are rest...

Please sign up or login with your details

Forgot password? Click here to reset