Convolutional Codes with Maximum Distance Profile

Simple item page
dc.creatorHutchinson, R.
dc.creatorRosenthal, J.
dc.creatorSmarandache, R.
dc.date2003-07-14
dc.date.accessioned2026-07-07T08:18:13Z
dc.date.available2026-07-07T08:18:13Z
dc.descriptionMaximum distance profile codes are characterized by the property that two trajectories which start at the same state and proceed to a different state will have the maximum possible distance from each other relative to any other convolutional code of the same rate and degree. In this paper we use methods from systems theory to characterize maximum distance profile codes algebraically. Tha main result shows that maximum distance profile codes form a generic set inside the variety which parametrizes the set of convolutional codes of a fixed rate and a fixed degree.
dc.description15 pages, submitted to Systems and Control Letters, corrected date
dc.identifierhttps://arxiv.org/abs/math/0307196
dc.identifierhttp://arxiv.org/abs/math/0307196
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134358
dc.subjectOptimization and Control
dc.subjectInformation Theory
dc.subjectRings and Algebras
dc.subject94B10
dc.titleConvolutional Codes with Maximum Distance Profile
dc.typetext

Files

Collections

arXiv