On cyclic convolutional codes

From MaRDI portal
Publication:1876567

DOI10.1023/B:ACAP.0000027534.61242.09zbMATH Open1065.94019arXivmath/0305135MaRDI QIDQ1876567FDOQ1876567


Authors: Heide Gluesing-Luerssen, Wiland Schmale Edit this on Wikidata


Publication date: 20 August 2004

Published in: Acta Applicandae Mathematicae (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/math/0305135




Recommendations





Cited In (38)





This page was built for publication: On cyclic convolutional codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1876567)