Superregular Matrices and the Construction of Convolutional Codes having a Maximum Distance Profile

Simple item page
dc.creatorHutchinson, R.
dc.creatorSmarandache, R.
dc.creatorTrumpf, J.
dc.date2006-07-18
dc.date2006-07-19
dc.date.accessioned2026-07-07T08:16:39Z
dc.date.available2026-07-07T08:16:39Z
dc.descriptionSuperregular matrices are a class of lower triangular Toeplitz matrices that arise in the context of constructing convolutional codes having a maximum distance profile. These matrices are characterized by the property that no submatrix has a zero determinant unless it is trivially zero due to the lower triangular structure. In this paper, we discuss how superregular matrices may be used to construct codes having a maximum distance profile. We also introduce group actions that preserve the superregularity property and present an upper bound on the minimum size a finite field must have in order that a superregular matrix of a given size can exist over that field.
dc.description20 pages. Replaced on 19/7/2006, because bibtex files were not included in the original submission
dc.identifierhttps://arxiv.org/abs/cs/0607089
dc.identifierhttp://arxiv.org/abs/cs/0607089
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133854
dc.subjectInformation Theory
dc.subjectCombinatorics
dc.titleSuperregular Matrices and the Construction of Convolutional Codes having a Maximum Distance Profile
dc.typetext

Files

Collections

arXiv