Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.3934/amc.2008.2.55 | ADVANCES IN MATHEMATICS OF COMMUNICATIONS |
Keywords | DocType | Volume |
convolutional codes,cyclic codes,skew polynomial rings,Forney indices | Journal | 2 |
Issue | ISSN | Citations |
1 | 1930-5346 | 8 |
PageRank | References | Authors |
0.63 | 7 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fai-Lung Tsang | 1 | 9 | 1.03 |
| Heide Gluesing-Luerssen | 2 | 69 | 12.81 |