Advertisement

Novel Algebraic Structure for Cyclic Codes

  • Dang Hoai Bac
  • Nguyen Binh
  • Nguyen Xuan Quynh
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4851)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Prange, E.: Cyclic Error-Correcting Codes in Two Symbols. Electronics Research Directorate, Air Force Cambridge Res. Ctr. (1957)Google Scholar
  2. 2.
    MacWilliams, F.J., Sloane, N.J.A: The Theory of Error-Correcting Code. North-Holland, Amsterdam (1977)Google Scholar
  3. 3.
    Van Lint, J.H.: Introduction to Coding Theory, 3rd edn. Springer, Heidelberg (1999)zbMATHGoogle Scholar
  4. 4.
    Blahut, R.E.: Theory and Practice of Error Control Coding. Addison-Wesley, Reading, MA (1983)Google Scholar
  5. 5.
    Moon, T.K.: Error Correction Coding: Mathematical Methods and Algorithm. John Wiley & Sons, Inc., Chichester (2005)Google Scholar
  6. 6.
    Pincin, A.: A New Algorithm for Multiplication in Finite Fields. IEEE Trans. Computer 38(1), 1045–1049 (1989)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Namin, A.H., Wu, H., Ahmadi, M.: Comb Architectures for Finite Field Multiplication in F_2m. IEEE Trans. Computers 56(7), 909–916 (2007)CrossRefGoogle Scholar
  8. 8.
    Katti, R., Brennan, J.: Low Complexity Multiplication in a Finite Field Using Ring Representation. IEEE Trans. Computers 52(4), 418–427 (2003)CrossRefGoogle Scholar
  9. 9.
    Lidl, R., Niederreiter, H.: Introduction to Finite Fields and Their Applications, 2nd edn. Cambridge Univ. Press, Cambridge (1997)Google Scholar
  10. 10.
    Wang, C.C., Truong, T.K., Shao, H.M., Deutsch, L.J., Omura, J.K., Reed, I.S.: VLSI Architectures for Computing Multiplications and Inverses in GF(2m). IEEE Trans. Computers 34(8), 709–717 (1985)zbMATHCrossRefGoogle Scholar
  11. 11.
    Wu, H., Hasan, M.A., Blake, I.F., Gao, S.: Finite Field Multiplier Using Redundant Representation. IEEE Trans. Computers 51(11), 1306–1316 (2002)CrossRefMathSciNetGoogle Scholar
  12. 12.
    Baodian, W., Liu, D., Ma, W., Wang, X.: Property of Finite Fields and Its Cryptography Application. Electron. Lett. 39, 655–656 (2003)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Dang Hoai Bac
    • 1
    • 2
  • Nguyen Binh
    • 1
  • Nguyen Xuan Quynh
    • 1
  1. 1.Electronics Faculty, Posts & Telecommunications Institute of Technology (PTIT)-Vietnam. Km 10 Hanoi-Hadong Road 
  2. 2.Mobile Telecommunication Research Division, Electronics & Telecommunications Research Institute (ETRI)Korea

Personalised recommendations