Computer Science – Information Theory
Scientific paper
2006-07-18
Computer Science
Information Theory
20 pages. Replaced on 19/7/2006, because bibtex files were not included in the original submission
Scientific paper
Superregular 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.
Hutchinson Robert
Smarandache Roxana
Trumpf Jochen
No associations
LandOfFree
Superregular Matrices and the Construction of Convolutional Codes having a Maximum Distance Profile does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Superregular Matrices and the Construction of Convolutional Codes having a Maximum Distance Profile, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Superregular Matrices and the Construction of Convolutional Codes having a Maximum Distance Profile will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-121472