Construction of θ-Cyclic Codes over an Algebra of Order 4

被引:0
作者
Irwansyah [1 ]
Muchtadi-Alamsyah, Intan [1 ]
Barra, Aleams [1 ]
Muchlis, Ahmad [1 ]
Supriyanto, Djoko [2 ]
机构
[1] Bandung Inst Technol, Algebra Res Grp, Bandung, Indonesia
[2] Inst Teknol Bandung, Combinatorial Math Res Grp, Bandung, Indonesia
来源
PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON COMPUTATION FOR SCIENCE AND TECHNOLOGY | 2015年 / 5卷
关键词
BCH codes; Berlekamp-Massey decoding algorithm; binary cyclic codes; theta-cyclic codes; gray map;
D O I
暂无
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In this paper, we show that theta-cyclic codes over algebra A(1) = F-2 + vF(2) can be constructed from binary cyclic codes using a bijection map from A(1) to F(2)xF(2). We also give a decoding algorithm for theta-cyclic codes which are constructed using well-known BCH codes over binary field.
引用
收藏
页码:141 / 143
页数:3
相关论文
共 5 条
[1]  
Abualrub T, 2012, AUSTRALAS J COMB, V54, P115
[2]   Optimal self-dual codes over F2 x F2 with respect to the hamming weight [J].
Betsumiya, K ;
Harada, M .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (02) :356-358
[3]   Skew-cyclic codes [J].
Boucher, D. ;
Geiselmann, W. ;
Ulmer, F. .
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2007, 18 (04) :379-389
[4]   Coding with skew polynomial rings [J].
Boucher, Delphine ;
Ulmer, Felix .
JOURNAL OF SYMBOLIC COMPUTATION, 2009, 44 (12) :1644-1656
[5]  
Gao Jian, 2013, Journal of Applied Mathematics and Informatics, V31, P337