Introducing Three Best Known Goppa Codes

10/14/2020
by   Jan L. Carrasquillo-López, et al.
0

The current best known [239, 21], [240, 21], and [241, 21] binary linear codes have minimum distance 98, 98, and 99 respectively. In this article, we introduce three binary Goppa codes with Goppa polynomials (x^17 + 1)^6, (x^16 + x)^6, and (x^15 + 1)^6. The Goppa codes are [239, 21, 103], [240, 21, 104], and [241, 21, 104] binary linear codes respectively. These codes have greater minimum distance than the current best known codes with the respective length and dimension. In addition, with the techniques of puncturing, shortening, and extending, we find more derived codes with a better minimum distance than the current best known codes with the respective length and dimension.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

12/11/2020

Classification of 8-divisible binary linear codes with minimum distance 24

We classify 8-divisible binary linear codes with minimum distance 24 and...
06/06/2019

The [46,9,20]_2 code is unique

The minimum distance of all binary linear codes with dimension at most e...
12/14/2021

Parameterized codes over graphs

In this article we review known results on parameterized linear codes ov...
07/09/2019

Better Sample -- Random Subset Sum in 2^0.255n and its Impact on Decoding Random Linear Codes

We propose a new heuristic algorithm for solving random subset sum insta...
12/06/2019

Globally optimizing small codes in real projective spaces

For d∈{5,6}, we classify arrangements of d + 2 points in RP^d-1 for whic...
08/08/2021

A Database of Quantum Codes

Quantum error correcting codes (QECC) is becoming an increasingly import...
11/04/2019

A Hierarchical-based Greedy Algorithm for Echelon-Ferrers Construction

Echelon-Ferrers is one of important techniques to help researchers to im...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.