A concatenated code consist of two codes: A short "inner" code and a long "outer" code. The outer code is often a Reed-Solomon code. Concatenation is the only known construction which allows for the correction of a large number of errors, with a fairly low complexity. Concatenated codes are therefore widely used. In this project we study the algebraic structure of concatenated codes. This analysis has led to the construction of large classes of cyclic codes, which performs better than the well-known and widely used BCH codes. It has also led to the design of a low-complexity Reed-Solomon encoder. Some problems concerning decoding are currently under investigation.
|Effective start/end date||01/01/1996 → …|