2016/01/12 by P. J. Almeida, Paulo José Fernandes Almeida, Diego Napp +6
Biochemistry, Genetics and Molecular Biology · Computer Science · Mathematics · #15B33 #94B10 #Chromatin Remodeling and Cancer #Coding theory and cryptography #Combinatorics (math.CO) #Cooperative Communication and Network Coding #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Rings and Algebras (math.RA) #cs.IT #math.CO #math.IT #math.RA #msc:15B33 #msc:94B10
paper · pdf · doi:10.48550/arxiv.1601.02960
arxiv created 2016/01/12 · openalex publication_date 2016/01/12 · arxiv updated 2016/01/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The main results of this paper are twofold: the first one is a matrix theoretical result. We say that a matriz is superregular if all of its minors that are not trivially zero are nonzero. Given a a times b, a larger than or equal to b, superregular matrix over a field, we show that if all of its rows are nonzero then any linear combination of its columns, with nonzero coefficients, has at least a-b+1 nonzero entries. Secondly, we make use of this result to construct convolutional codes that attain the maximum possible distance for some fixed parameters of the code, namely, the rate and the Forney indices. These results answer some open questions on distances and constructions of convolutional codes posted in the literature.