This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| extended Reed–Solomon codes | |
|---|---|
| Name | Extended Reed–Solomon codes |
| Field | Coding theory |
| Invented by | Irving S. Reed; Gustave Solomon |
| First published | 1960s |
| Related | Reed–Solomon codes, BCH codes, Goppa codes, Reed–Muller codes |
extended Reed–Solomon codes
Extended Reed–Solomon codes are a class of linear error-correcting codes derived from Irving S. Reed and Gustave Solomon's Reed–Solomon codes by adding one or more parity coordinates, and they play a central role in algebraic coding theory linked to many developments across mathematics and engineering. They connect to classical results studied by researchers at institutions such as Bell Labs, MIT, and Princeton University, and are employed in standards developed by organizations like ITU and IEEE. The theory interfaces with algebraic geometry results popularized by scholars at University of California, Berkeley, University of Cambridge, and École Normale Supérieure, and with algorithmic advances traced to work at IBM and Microsoft Research.
Extended Reed–Solomon codes arise as one-point extensions of Reed–Solomon codes over finite fields studied by pioneers associated with Bell Labs and MIT Lincoln Laboratory, and they are often presented alongside BCH codes and Goppa codes in textbooks used at Stanford University and Caltech. The extension process increases block length by adding a coordinate, linking theoretical analyses performed in seminars at Institute for Advanced Study and Courant Institute to practical deployments in products by Sony, Philips, and Samsung. Historical expositions reference conferences such as IEEE International Symposium on Information Theory and prizes like the Shannon Award that recognized foundational work in the area.
An extended Reed–Solomon code is constructed over a finite field often denoted GF(q) following methods developed in papers from research groups at Harvard University and Yale University, extending a length-n Reed–Solomon code to length n+1 by appending an overall parity or evaluation at an extra point selected from the projective line used in algebraic formulations inspired by Alexander Grothendieck's viewpoint. Construction recipes are taught in courses at University of Illinois Urbana–Champaign and University of Waterloo and align with algebraic structures studied at Princeton University and University of Paris. The defining generator matrices and parity-check matrices relate to Vandermonde matrices analyzed in the context of numerical work at Argonne National Laboratory and Los Alamos National Laboratory.
Extended Reed–Solomon codes inherit the maximum distance separable property demonstrated in classical proofs associated with Elias and Shannon, giving minimum distance d = n − k + 1 for the parent code and adjustments when the extra coordinate is appended, as studied in seminars at ETH Zurich and Imperial College London. Their dual codes connect to generalized Reed–Solomon codes and to constructions discussed by researchers at Max Planck Institute for Mathematics, while weight-distribution results have been computed in collaborations involving University of Cambridge and Oxford University. Bounds such as the Singleton bound and implications for list decoding were topics at conferences including the ACM Symposium on Theory of Computing and the European Symposium on Algorithms.
Decoding algorithms for extended Reed–Solomon codes extend classical procedures attributed to researchers at Bell Labs and algorithms developed at MIT and Stanford University, including variants of the Berlekamp–Massey algorithm and Euclidean algorithm approaches taught in courses at Carnegie Mellon University and Rutgers University. Fast implementations using fast Fourier transform techniques were advanced in collaborations involving Bell Labs and AT&T Research, and improvements leveraging algebraic geometry and list-decoding ideas trace to work at Microsoft Research and Google Research. Syndrome computation and error-location heuristics are standard in curricula at Duke University and Brown University and are implemented in hardware by firms like Intel and Broadcom.
Generalizations of extended Reed–Solomon codes include alternant codes, generalized Reed–Solomon codes, and algebraic-geometric codes building on ideas from Vladimir Drinfeld and Igor Shafarevich; these developments were pursued at institutions such as Steklov Institute of Mathematics and University of Tokyo. Quantum analogues, inspired by stabilizer formalisms studied at Caltech and MIT, produce quantum error-correcting codes influenced by generalized Reed–Solomon constructions and by research groups at IBM Quantum and Google Quantum AI. Links to combinatorial design theory researched at University of Oxford and Princeton University yield connections with finite geometry results from University of Warsaw and Moscow State University.
Extended Reed–Solomon codes are used in storage systems developed by IBM, Seagate Technology, and Western Digital, in digital broadcasting standards devised by DVB Project and ETSI, and in space communications programs at NASA and European Space Agency. They appear in optical media standards by Sony, Panasonic, and Philips and in packet transmission schemes standardized by 3GPP and IETF. Cryptographic and forensics applications draw on analyses from NIST and algorithmic work at RSA Security and CERT Coordination Center.
Explicit constructions include the binary and nonbinary extended Reed–Solomon examples documented in textbooks used at University of California, Los Angeles and University of Texas at Austin and in lecture notes from Columbia University and Cornell University. Concrete parameter choices over GF(2^m) used in optical disc standards by Sony and in satellite links by Eutelsat illustrate implementations that were prototyped at JPL and field-tested by ESA. Detailed generator matrices and parity-check equations are derived following methodologies presented at NIPS workshops and in doctoral theses from University of Michigan and Northwestern University.