2013/09/06 by Gao, Jian, Shen, Linzhi, Fu, Fang-Wei
#94B05 #94B15 #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · doi:10.48550/arxiv.1309.1621
In this work, we study a class of generalized quasi-cyclic (GQC) codes called skew GQC codes. By the factorization theory of ideals, we give the Chinese Remainder Theorem over the skew polynomial ring, which leads to a canonical decomposition of skew GQC codes. We also focus on some characteristics of skew GQC codes in details. For a 1-generator skew GQC code, we define the parity-check polynomial, determine the dimension and give a lower bound on the minimum Hamming distance. The skew quasi-cyclic (QC) codes are also discussed briefly.