On doubly-cyclic convolutional codes

Simple item page
dc.creatorGluesing-Luerssen, Heide
dc.creatorSchmale, Wiland
dc.date2004-10-13
dc.date.accessioned2026-07-07T08:18:16Z
dc.date.available2026-07-07T08:18:16Z
dc.descriptionCyclicity of a convolutional code (CC) is relying on a nontrivial automorphism of the algebra F[x]/(x^n-1), where F is a finite field. If this automorphism itself has certain specific cyclicity properties one is lead to the class of doubly-cyclic CC's. Within this large class Reed-Solomon and BCH convolutional codes can be defined. After constructing doubly-cyclic CC's, basic properties are derived on the basis of which distance properties of Reed-Solomon convolutional codes are investigated.This shows that some of them are optimal or near optimal with respect to distance and performance.
dc.identifierhttps://arxiv.org/abs/math/0410317
dc.identifierhttp://arxiv.org/abs/math/0410317
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134375
dc.subjectRings and Algebras
dc.subjectInformation Theory
dc.subject94B10, 94B15, 16S36
dc.titleOn doubly-cyclic convolutional codes
dc.typetext

Files

Collections

arXiv