On doubly-cyclic convolutional codes

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Cyclicity 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.

Keywords

Rings and Algebras, Information Theory, 94B10, 94B15, 16S36

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/134375

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0410317
 http://arxiv.org/abs/math/0410317

Collections

arXiv