Computer Science – Information Theory
Scientific paper
2007-08-09
Computer Science
Information Theory
Scientific paper
In this paper, we study convolutional codes with a specific cyclic structure. By definition, these codes are left ideals in a certain skew polynomial ring. Using that the skew polynomial ring is isomorphic to a matrix ring we can describe the algebraic parameters of the codes in a more accessible way. We show that the existence of such codes with given algebraic parameters can be reduced to the solvability of a modified rook problem. It is our strong belief that the rook problem is always solvable, and we present solutions in particular cases.
Gluesing-Luerssen Heide
Tsang Fai-Lung
No associations
LandOfFree
A Matrix Ring Description for Cyclic Convolutional Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Matrix Ring Description for Cyclic Convolutional Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Matrix Ring Description for Cyclic Convolutional Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-46235