Paper Info
Title
On generator polynomial matrices of generalized pseudo-cyclic codes
Abstract
In this paper, generalized pseudo-cyclic (GPC) codes are proposed and their basic properties are investigated. Generator polynomial matrices of GPC codes are constructively defined and thereby a dimension formula for GPC codes is provided. While a pseudo-cyclic code is equal to an ideal of the ring which consists of polynomials modulo a fixed polynomial, a GPC code is equal to a submodule of the direct sum of the rings which consist of polynomials modulo fixed polynomials. In the theory of cyclic codes and PC codes, Euclidean division algorithm for polynomials is essential; its generalization for polynomial vectors is obtained and enables us with generator polynomial matrices to encode GPC codes fast and systematically.
Year
Venue
Keywords
2014
ISITA
cyclic codes,polynomial matrices,euclidean division algorithm,gpc codes,generalized pseudocyclic codes,generator polynomial matrices,polynomial modulo fixed polynomials,polynomial vector generalization
Field
DocType
Citations 
Discrete mathematics,Stable polynomial,Polynomial,Polynomial matrix,Cyclic redundancy check,Burst error-correcting code,Monic polynomial,Reciprocal polynomial,Matrix polynomial,Mathematics
Conference
0
PageRank 
References 
Authors
0.34
5
1
Name
Order
Citations
PageRank
Hajime Matsui1188.14