On the Gray Image of Cyclic Codes over Finite Chain Rings
スポンサーリンク
概要
- 論文の詳細を見る
We introduce (1-γ)-cyclic code and cyclic codes over the finite chain ring R. We prove that the Gray image of a linear (1-γ)-cyclic code over R of length n is a distance invariant quasi-cyclic code over Fpk. We also prove that if (n, p)=1, then every code over Fpk which is the Gray image of a cyclic code over R of length n is equivalent to a quasi-cyclic code.
- (社)電子情報通信学会の論文
- 2008-09-01
著者
-
Ma Wenping
Xidian Univ. Xi'an Chn
-
Wang Xinmei
Xidian Univ. Xi'an Chn
-
QIAN Jianfa
National Key Laboratory of ISN, Xidian University
-
MA Wenping
National Key Laboratory of ISN, Xidian University
-
WANG Xinmei
National Key Laboratory of ISN, Xidian University
-
Qian Jianfa
National Key Laboratory Of Isn Xidian University
-
Ma Wenping
National Key Laboratory Of Isn Xidian University
関連論文
- Security Analysis of the Newest ID-Transfer Scheme for Low-Cost RFID Tags
- On the Gray Image of Cyclic Codes over Finite Chain Rings
- High Rate Recursive Space-Time Trellis Code Designed for Serially Concatenated Space-Time Codes(Wireless Communication Technologies)