On doubly-cyclic convolutional codes

Details On doubly-cyclic convolutional codes On doubly-cyclic convolutional codes

2004-10-13

arxiv.org/abs/math/0410317v1

Mathematics

Rings and Algebras

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On doubly-cyclic convolutional codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On doubly-cyclic convolutional codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On doubly-cyclic convolutional codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-136747