showed that cyclic codes can be constructed based on the lines of two classes of finite geometries, namely, Euclidean and projective geometries. It was shown that these cyclic finite-geometry (FG) codes can be decoded with the simple one-step majority-logic decoding (OSMLD) based on the orthogonal structure of their parity-check matrices.
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.