Counting Extended Irreducible Goppa Codes

02/23/2018
by   Kondwani Magamba, et al.
0

We obtain an upper bound on the number of extended irreducible q-ary Goppa codes of degree r and length q^n+1, where q=p^t and n and r>2 are prime numbers.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/28/2021

Extended Irreducible Binary Sextic Goppa codes

Let n (>3) be a prime number and F_2^n a finite field of 2^n elements. L...
research
03/26/2019

Enumeration of irreducible and extended irreducible Goppa codes

We obtain upper bounds on the number of irreducible and extended irreduc...
research
04/07/2018

On the ratio of prefix codes to all uniquely decodable codes with a given length distribution

We investigate the ratio ρ_n,L of prefix codes to all uniquely decodable...
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
12/11/2022

Doubly and triply extended MSRD codes

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

PERIDOT Codes: Replacing Identifiers, Sequence Numbers and Nonces with Permutations

Identifiers and sequence numbers make up a large part of the protocol ov...
research
11/24/2017

A Fowler-Nordheim Integrator can Track the Density of Prime Numbers

"Does there exist a naturally occurring counting device that might eluci...

Please sign up or login with your details

Forgot password? Click here to reset