Inand , two types of cyclic codes, namely, BCH and RS codes, are constructed based on finite fields, and they not only have distinctive algebraic structures but are also powerful in correcting errors. In this chapter, we show that cyclic codes can be constructed based on finite geometries.
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.