Distance bounds for convolutional codes and some optimal codes

Simple item page
dc.creatorGluesing-Luerssen, Heide
dc.creatorSchmale, Wiland
dc.date2003-05-09
dc.date.accessioned2026-07-07T08:18:13Z
dc.date.available2026-07-07T08:18:13Z
dc.descriptionAfter 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.
dc.description22 pages
dc.identifierhttps://arxiv.org/abs/math/0305135
dc.identifierhttp://arxiv.org/abs/math/0305135
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134356
dc.subjectRings and Algebras
dc.subjectInformation Theory
dc.subjectOptimization and Control
dc.subject94B10; 94B15; 16S36
dc.titleDistance bounds for convolutional codes and some optimal codes
dc.typetext

Files

Collections

arXiv