Code Constructions based on Reed-Solomon Codes

2017/06/19 by Michael Schelling, Schelling, Michael, Martin Bossert +1
Computer Science · Engineering · #Cellular Automata and Applications #Coding theory and cryptography #FOS: Computer and information sciences #Information Theory (cs.IT) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1706.05830

openalex publication_date 2017/06/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Reed--Solomon codes are a well--studied code class which fulfill the Singleton bound with equality. However, their length is limited to the size q of the underlying field \mathbbF_q. In this paper we present a code construction which yields codes with lengths of factors of the field size. Furthermore a decoding algorithm beyond half the minimum distance is given and analyzed.

Related

• On the List and Bounded Distance Decodibility of the Reed-Solomon Codes
• Reed-Solomon Codes over Fields of Characteristic Zero
• Reed-Solomon-Gabidulin Codes
• Reed Solomon Codes Against Adversarial Insertions and Deletions
• On error distance of received words with fixed degrees to Reed-Solomon code