The dimension of subcode-subfields of shortened generalized Reed-Solomon codes

DOI10.1007/S10623-012-9628-ZzbMATH Open1301.94145arXiv1108.5475OpenAlexW2049979688WikidataQ62582185 ScholiaQ62582185MaRDI QIDQ356722FDOQ356722

Authors: Fernando Hernando, Kyle Marshall, Michael E. O'Sullivan 

Publication date: 26 July 2013

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

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 by an RS code by shortening or puncturing. Generalized Reed-Solomon (GRS) codes are a generalization of RS codes, whose subfield-subcodes are extensively studied. In this paper we show that a particular class of GRS codes produces many subfield-subcodes with large dimension. An algorithm for searching through the codes is presented as well as a list of new codes obtained from this method.

Full work available at URL: https://arxiv.org/abs/1108.5475

Recommendations

• Subspace subcodes of generalized Reed-Solomon codes
• On the subfield subcodes of Hermitian codes
• On subfield subcodes of modified Reed-Solomon codes (Corresp.)
• New code parameters from Reed-Solomon subfield codes
• Subspace subcodes of Reed-Solomon codes

zbMATH Keywords

minimum distancegeneralized Reed-Solomon codesnew codessubfield-subcodes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Finite fields (field-theoretic aspects) (12E20) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Cyclic codes (94B15) Arithmetic theory of polynomial rings over finite fields (11T55) Applications to coding theory and cryptography of arithmetic geometry (14G50) Cyclotomy (11T22)

Cites Work

• The Magma algebra system. I: The user language
• Fundamentals of Error-Correcting Codes
• Title not available (Why is that?)
• On subfield subcodes of modified Reed-Solomon codes (Corresp.)
• Proof of conjectures on the true dimension of some binary Goppa codes
• On the dimension of subfield subcodes
• The trace operator and redundancy of Goppa codes

Cited In (10)

• Quantum codes from affine variety codes and their subfield-subcodes
• On subfield subcodes of modified Reed-Solomon codes (Corresp.)
• Subspace subcodes of generalized Reed-Solomon codes
• On the dimension of subfield subcodes
• New identities relating wild Goppa codes
• On counting subring-submodules of free modules over finite commutative Frobenius rings
• An improvement of the Feng-Rao bound for primary codes
• Identifying High-Dimension Subspace Subcodes of Reed–Solomon Codes
• On the dimension of algebraic-geometric trace codes
• Entanglement-assisted quantum error-correcting codes from subfield subcodes of projective Reed-Solomon codes

Uses Software

• Magma

This page was built for publication: The dimension of subcode-subfields of shortened generalized Reed-Solomon codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q356722)