Name
Abstract | ||
|---|---|---|
Reed–Solomon (RS) codes are among the most ubiquitous codes due to their good parameters as well as efficient encoding and decoding procedures. However, RS codes suffer from having a fixed length. In many applications where the length is static, the appropriate length can be obtained from an RS code by shortening or puncturing. Generalized Reed–Solomon (GRS) codes are a generalization of RS codes, whose subfield-subcodes (SFSC) are extensively studied. In this paper we show that a particular class of GRS codes produces many SFSC with large dimension. We present two algorithms for searching through these codes and a list of new best-known codes obtained. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/s10623-012-9628-z | Designs, Codes and Cryptography |
Keywords | DocType | Volume |
Subfield-subcodes,Generalized Reed–Solomon codes,Dimension,New codes,11T71,11T22,68P30,14G50 | Journal | abs/1108.5475 |
Issue | ISSN | Citations |
1 | 0925-1022 | 5 |
PageRank | References | Authors |
0.49 | 6 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fernando Hernando | 1 | 56 | 8.81 |
| Kyle Marshall | 2 | 23 | 3.68 |
| Michael E. O'Sullivan | 3 | 88 | 9.65 |