A Matrix Ring Description for Cyclic Convolutional Codes

Simple item page
dc.creatorGluesing-Luerssen, Heide
dc.creatorTsang, Fai-Lung
dc.date2007-08-09
dc.date.accessioned2026-07-07T08:23:03Z
dc.date.available2026-07-07T08:23:03Z
dc.descriptionIn 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.
dc.identifierhttps://arxiv.org/abs/0708.1343
dc.identifierhttp://arxiv.org/abs/0708.1343
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/135856
dc.subjectInformation Theory
dc.subjectRings and Algebras
dc.titleA Matrix Ring Description for Cyclic Convolutional Codes
dc.typetext

Files

Collections

arXiv