Distance bounds for convolutional codes and some optimal codes
<|reference_start|>Distance bounds for convolutional codes and some optimal codes: 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.<|reference_end|>
@article{gluesing-luerssen2003distance,
    title={Distance bounds for convolutional codes and some optimal codes},
    author={Heide Gluesing-Luerssen and Wiland Schmale},
    journal={arXiv preprint arXiv:math/0305135},
    year={2003},
    archivePrefix={arXiv},
    eprint={math/0305135},
    primaryClass={math.RA cs.IT math.IT math.OC}
}