| Paper ID | C-1-1.2 |
| Paper Title |
CONSTRUCTION OF CYCLICALLY PERMUTABLE CODES FROM PRIME LENGTH CYCLIC CODES |
| Authors |
Keng-Pei Cho, Chun-Long Lin, Houshou Chen, Ting-Ya Yang, National Chung Hsing University, Taiwan |
| Session |
C-1-1: Wireless Communications and Networking |
| Time | Tuesday, 08 December, 12:30 - 14:00 |
| Presentation Time: | Tuesday, 08 December, 12:45 - 13:00 Check your Time Zone |
|
All times are in New Zealand Time (UTC +13) |
| Topic |
Wireless Communications and Networking (WCN): |
| Abstract |
This paper proposes a novel algorithm to find the cyclically permutable codes (CPCs) from a cyclic code. In recent years, the CPCs are increasingly important, and have been applied in the communication network and optical communication. A CPC is a block code such that each codeword has full cyclic order and all codewords are cyclically distinct. In this paper, we propose an effective methods to find all codewords with full cyclic order from a q-ary cyclic code. More precisely, we use the characteristics of finite fields to develop an efficient algorithm to find a CPC from a cyclic code of prime-primitive length and prime-nonprimitive length respectively. |