Skip Navigation

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 2006 E89-A(6):1863-1865; doi:10.1093/ietfec/e89-a.6.1863
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Request Permissions
Google Scholar
Right arrow Articles by QIAN, J.-F.
Right arrow Articles by ZHU, S.-X.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Copyright © 2006 The Institute of Electronics, Information and Communication Engineers

Regular Section -- Letters -- Coding Theory

Constacyclic and Cyclic Codes over F2 + uF2 + u2F2

Jian-Fa QIAN1, Li-Na ZHANG1 and Shi-Xin ZHU2

1 The authors are with the Department of Mathematics and Physics, Anhui University of Science and Technology, Huainan 232001, Anhui, P.R. China. E-mail: qianjianfa{at}yahoo.com.cn, E-mail: linazhang222{at}sohu.com, 2 The author is with the Department of Applied Mathematics, Hefei University of Technology, Hefei 230009, Anhui, P.R. China.

A new Gray map between codes over F2 + uF2 + u2F2 and codes over F2 is defined. We prove that the Gray image of a linear (1-u2)-cyclic code over F2 + uF2 + u2F2 of length n is a binary distance invariant linear quasi-cyclic code. We also prove that, if n is odd, then every binary code which is the Gray image of a linear cyclic code over F2 + uF2 + u2F2 of length n is equivalent to a quasi-cyclic code.

Key Words: cyclic code, constacyclic code, quasi-cyclic code, Gray map

Manuscript received April 15, 2005. Manuscript revised December 26, 2005. Final manuscript received February 17, 2006.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.