Cyclic Convolutional Codes over Separable Extensions

被引：1
|
作者：
Gomez-Torrecillas, Jose [1 ,2 ]
Lobillo, F. J. [1 ,2 ]
Navarro, Gabriel [2 ,3 ]
机构：
[1] Univ Granada, Dept Algebra, Granada, Spain
[2] Univ Granada, CITIC, Granada, Spain
[3] Univ Granada, Dept Comp Sci & AI, Granada, Spain
来源：
CODING THEORY AND APPLICATIONS, 4TH INTERNATIONAL CASTLE MEETING | 2015年 / 3卷
关键词：
Separable extension; Convolutional code; Ideal code; CONSTRUCTIONS;
D O I：
10.1007/978-3-319-17296-5_22
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We show that, under mild conditions of separability, an ideal code, as defined in Lopez-Permouth and Szabo (J Pure ApplAlgebra 217(5): 958-972,2013), is a direct summand of an Ore extension and, consequently, it is generated by an idempotent element. We also design an algorithm for computing one of these idempotents.
引用
收藏
页码：209 / 215
页数：7
相关论文
共 50 条
12345