On doubly-cyclic convolutional codes
Heide Gluesing-Luerssen, Wiland Schmale
Abstract
Cyclicity of a convolutional code (CC) is relying on a nontrivial automorphism of the algebra F[x]/(xn-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.
Create a lesson
Related papers
Directed partial orders on the complex number field
Wenyi Wang, Ruisong Yuan, Yuehui Zhang et al.
Polynomial identities, central polynomials and cocharacters of M2(F) with G-graded involution
Rafael Bezerra dos Santos, Lucas Reis
Polynomial identities, central polynomials and cocharacters of M2(F) with transpose superinvolution
Rafael Bezerra dos Santos, Lucas Reis
Range-compatible homomorphisms on Hermitian matrices
Clément de Seguins Pazzis
Transposed Triple Products and Pro-Symmetric Rings in -Rings
Huaxi Chen, Long Wang, Honglin Zou
On -Reversible and Generalized -Reversible Rings
Huaxi Chen, Long Wang, Honglin Zou