Name
Abstract | ||
|---|---|---|
Goppa codes have some of the largest minimum distances possible for linear codes. The authors use some binary Goppa codes in which four new binary codes are obtained with parameters better than any codes known to date. The authors also present the necessary conditions for a code obtained by shortening a longer code which will have a greater minimum distance than the original code. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1049/iet-com.2011.0693 | IET COMMUNICATIONS |
Keywords | Field | DocType |
binary codes | Hamming code,Discrete mathematics,Concatenated error correction code,Block code,Expander code,Real-time computing,Goppa code,Reed–Muller code,Linear code,Tornado code,Mathematics | Journal |
Volume | Issue | ISSN |
7 | 3 | 1751-8628 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mubarak Jibril | 1 | 2 | 1.41 |
| Martin Tomlinson | 2 | 106 | 19.89 |
| C. Tjhai | 3 | 24 | 6.02 |
| mohammed zaki ahmed | 4 | 16 | 6.01 |
| Sergey Bezzateev | 5 | 48 | 18.05 |