Unimodular arrays

DOI10.1016/S0898-1221(00)00111-5MaRDI QIDQ1570096zbMATH OpenOpenAlexFDO

Authors Elwyn R. Berlekamp

Publication date 23 January 2001

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0898-1221(00)00111-5

zbMATH Keywords

convolutional codespathsunimodular matrices

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Convolutional codes (94B10)

Review text

This paper explores certain combinatorial problems, which are motivated by the theory of convolutional codes. One of the combinatorial problems involves arrays of integers in the plane, which lie to the southeast of some boundary and satisfy the condition that each square submatrix whose northwest corner is on the boundary, is unimodular (determinant \(=1\)).

Recommendations

• The combinatorics of binary arrays
• scientific article; zbMATH DE number 2037767
• Convolutional codes: a module theoretic approach
• On rectangular unimodular matrices over the algebraic integers
• Unimodular polynomial matrices over finite fields

Cites work

• A class of convolution codes
• scientific article; zbMATH DE number 6488188 (Why is no real title available?)

Cited in

(7)

• Orthogonal polynomials and Smith normal form
• Smith normal form of a multivariate matrix associated with partitions
• On the entry sum of cyclotomic arrays
• Size of Downsets in the Pushing Order and a Problem of Berlekamp
• scientific article; zbMATH DE number 5704250 (Why is no real title available?)
• Smith normal form in combinatorics
• Size of downsets in the pushing order and a problem of Berlekamp

This page was built for publication: Unimodular arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1570096)