The dimension of subcode-subfields of shortened generalized Reed–Solomon codes
comunitat-uji-handle:10234/9
comunitat-uji-handle2:10234/7037
comunitat-uji-handle3:10234/8635
comunitat-uji-handle4:
INVESTIGACIONThis resource is restricted
http://dx.doi.org/10.1007/s10623-012-9628-z |
Metadata
Title
The dimension of subcode-subfields of shortened generalized Reed–Solomon codesDate
2012-03Publisher
Springer USType
info:eu-repo/semantics/articlePublisher version
http://link.springer.com/article/10.1007/s10623-012-9628-zVersion
info:eu-repo/semantics/publishedVersionSubject
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 ... [+]
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. [-]
Is part of
Designs, Codes and Cryptography. 2012 MarchRights
http://rightsstatements.org/vocab/CNE/1.0/
info:eu-repo/semantics/restrictedAccess
info:eu-repo/semantics/restrictedAccess
This item appears in the folowing collection(s)
- MAT_Articles [755]