Finite fields have been applied to construct error-correcting codes for reliable information transmission and data storage [–] since the late 1950s. These codes are commonly called algebraic codes, which have nice structures and large minimum distances. The most well-known classical algebraic codes are BCH and RS codes presented inandwhich can be decoded with the elegant hard-decision Berlekamp–Massey iterative algorithm.
Review the options below to login to check your access.
Log in with your Cambridge Higher Education account to check access.
If you believe you should have access to this content, please contact your institutional librarian or consult our FAQ page for further information about accessing our content.