The truncated and supplemented Pascal matrix and applications

DOI10.2140/INVOLVE.2018.11.243MaRDI QIDQ1684516zbMATH OpenOpenAlexFDO

Authors Michael Hua, S. B. Damelin, Jeffrey Sun, Mingchao Yu

Publication date 11 December 2017

Published in Involve (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1506.07437

zbMATH Keywords

networkMDScodematroidcodingPascalmaximum distance separable

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Orthogonal arrays, Latin squares, Room squares (05B15) Other designs, configurations (05B30) Combinatorial aspects of matroids and geometric lattices (05B35) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Combinatorial codes (94B25) Well-distributed sequences and other variations (11K36)

Abstract: In this paper, we introduce the $kimesn$ (with $kleqn$) truncated, supplemented Pascal matrix which has the property that any $k$ columns form a linearly independent set. This property is also present in Reed-Solomon codes; however, Reed-Solomon codes are completely dense, whereas the truncated, supplemented Pascal matrix has multiple zeros. If the maximal-distance separable code conjecture is correct, then our matrix has the maximal number of columns (with the aformentioned property) that the conjecture allows. This matrix has applications in coding, network coding, and matroid theory.

Recommendations

• An application of the \(t\)-extension of the \(p\)-Fibonacci Pascal matrix in coding theory
• Sparse MDS matrices over small fields: a proof of the GM-MDS conjecture
• Matrix product codes over \(\mathbb{F}_p\)
• On generator matrices of MDS codes (Corresp.)
• Generalized Pascal matrices and their algebraic properties

Cites work

• A Random Linear Network Coding Approach to Multicast
• Finite geometry and combinatorial applications
• Linear network coding
• On inequivalent representations of matroids over finite fields
• On sets of vectors of a finite vector space in which every subset of basis size is a basis
• On sets of vectors of a finite vector space in which every subset of basis size is a basis. II
• On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory
• Polynomial Codes Over Certain Finite Fields

Cited in

(2)

• Pascal matrices, Reed-Muller expressions and Reed-Muller error correcting codes
• A generalization of the pascal matrix and an application to coding theory

This page was built for publication: The truncated and supplemented Pascal matrix and applications

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