Distance bounds for convolutional codes and some optimal codes

Details Distance bounds for convolutional codes and some optimal codes Distance bounds for convolutional codes and some optimal codes

2003-05-09

arxiv.org/abs/math/0305135v1

Mathematics

Rings and Algebras

22 pages

Scientific paper

After a discussion of the Griesmer and Heller bound for the distance of a convolutional code we present several codes with various parameters, over various fields, and meeting the given distance bounds. Moreover, the Griesmer bound is used for deriving a lower bound for the field size of an MDS convolutional code and examples are presented showing that, in most cases, the lower bound is tight. Most of the examples in this paper are cyclic convolutional codes in a generalized sense as it has been introduced in the seventies. A brief introduction to this promising type of cyclicity is given at the end of the paper in order to make the examples more transparent.

Affiliated with

Also associated with

No associations

Rating

Distance bounds for convolutional codes and some optimal 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 Distance bounds for convolutional codes and some optimal codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distance bounds for convolutional codes and some optimal codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-719602