VLSI Architectures for Computing Multiplications and Inverses in GF(2m)
IEEE Transactions on Computers
Introduction to finite fields and their applications
Introduction to finite fields and their applications
A New Algorithm for Multiplication in Finite Fields
IEEE Transactions on Computers
Introduction to Coding Theory
Finite Field Multiplier Using Redundant Representation
IEEE Transactions on Computers
Low Complexity Multiplication in a Finite Field Using Ring Representation
IEEE Transactions on Computers
Error Correction Coding: Mathematical Methods and Algorithms
Error Correction Coding: Mathematical Methods and Algorithms
Comb Architectures for Finite Field Multiplication in F(2^m)
IEEE Transactions on Computers
| Hi-index | 0.00 |
The novel algebraic structure for the cyclic codes, Cyclic Multiplicative Groups (CMGs) over polynomial ring, is proposed in this paper. According to this algorithm, traditional cyclic codes can be considered as a subclass in these cyclic codes. With CMGs structure, more plentiful good cyclic code cosets can be found in any polynomial rings than other methods. An arbitrary polynomial in polynomial ring can generate cyclic codes in which length of codewords depend on order of the polynomial. Another advantage of this method is that a longer code can be generated from a smaller polynomial ring. Moreover, our technique is flexibly and easily implemented in term of encoding as well as decoding. As a result, the CMGs can contribute a new point of view in coding theory. The significant advantages of proposed cyclic code cosets can be applicable in the modern communication systems and crypto-systems.