Name
Abstract | ||
|---|---|---|
We present a fast algorithm using Gröbner basis to compute the dimensions of subfield subcodes of Hermitian codes. With these algorithms we are able to compute the exact values of the dimension of all subfield subcodes up to q ≤ 32 and length up to 215. We show that some of the subfield subcodes of Hermitian codes are at least as good as the previously known codes, and we show the existence of good long codes. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/s10623-012-9736-9 | Des. Codes Cryptography |
Keywords | Field | DocType |
Subfield subcodes,Hermitian codes,Algebraic geometry codes,Gröbner basis,Decoding subfield subcodes,List-decoding of subfield subcodes,94B60,13P10,11T71,14G50,11Y,05E40,12Y05,14H05 | Discrete mathematics,Combinatorics,Gröbner basis,Hermitian matrix,Mathematics | Journal |
Volume | Issue | ISSN |
70 | 1-2 | 0925-1022 |
Citations | PageRank | References |
1 | 0.40 | 9 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fernando Pinero | 1 | 2 | 0.77 |
| Heeralal Janwa | 2 | 76 | 10.66 |