An Introduction to Reed-Solomon Codes
نویسندگان
چکیده
Journal of the Society for Industrial and Applied Mathematics. In June of 1960 the paper was published: five pages under the rather unpretentious title "Polynomial Codes over Certain Finite Fields" [17]. This paper described a new class of error-correcting codes that are now called Reed-Solomon codes. In the decades since their discovery, Reed-Solomon codes have enjoyed countless applications, from compact disc™ players in living rooms all over the planet to spacecraft that are now well beyond the orbit of Pluto. Reed-Solomon codes have been an integral part of the telecommunications revolution in the last half of the twentieth century. This book has been written in an attempt to capture the power and utility of these codes, as well as the history of their use. Each chapter has been written by specialists in digital communications who have used Reed-Solomon codes in their engineering designs or have made the analysis and implementation of Reed-Solomon codes a focus of their research. The chapters can be loosely grouped into four classes: history, code construction, applications, and decoding techniques. The chapter immediately following this introduction is a joint effort by Irving Reed and Gus Solomon. In this chapter they describe the events that led up to the discovery of Reed-Solomon codes and their experiences afterwards. It is basically historical in nature and provides some excellent insights into a great event in the history of digital communications technology. The remaining chapters deal
منابع مشابه
A general construction of Reed-Solomon codes based on generalized discrete Fourier transform
In this paper, we employ the concept of the Generalized Discrete Fourier Transform, which in turn relies on the Hasse derivative of polynomials, to give a general construction of Reed-Solomon codes over Galois fields of characteristic not necessarily co-prime with the length of the code. The constructed linear codes enjoy nice algebraic properties just as the classic one.
متن کاملReed - Solomon Hybrid Codes For Optical Communications
The astonishing performance of concatenated codes attracted many researchers and this has resulted in an explosive amount of literature since their introduction few years ago. As concatenation between codes did not actually arise from applying a pre-existing theory, most of their outstanding features remain to be explained. This paper gives some explanation of the concatenation between Reed Sol...
متن کاملAn Efficient SISO Algorithm for Reed-Solomon Codes
There has been renewed interest in iterative decoding algorithms for concatenated codes since the introduction of Turbo codes. Such iterative methods are built on top of soft-insoft-out algorithms. Powerful concatenated codes may be constructed with linear block codes codes as constituent codes. Such codes can be better alternatives to Turbo Codes either when high coding rates or when short int...
متن کاملIntroduction to Algebraic Coding Theory
4 Ideals and cyclic codes 18 4.1 Ideals . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 4.2 Cyclic codes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20 4.3 Group of a code . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22 4.4 Minimal polynomials . . . . . . . . . . . . . . . . . . . . . . . . . 24 4.5 BCH and Reed-Solomon codes . . . . . . . . . . ....
متن کامل