2006/07/18 by R. Hutchinson, Ryan Hutchinson, Roxana Smarandache +6
Computer Science · Engineering · Mathematics · #Advanced Wireless Communication Techniques #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #cs.IT #graph theory and CDMA systems #math.CO #math.IT
paper · pdf · doi:10.48550/arxiv.cs/0607089
20 pages. Replaced on 19/7/2006, because bibtex files were not included in the original submission
openalex publication_date 2006/07/18 · arxiv created 2006/07/19 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.