In this paper, we introduce the
(with
)
truncated, supplemented Pascal matrix, which has the property that any
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 maximum
distance separable code conjecture is correct, then our matrix has the maximal
number of columns (with the aforementioned property) that the conjecture
allows. This matrix has applications in coding, network coding, and matroid
theory.
PDF Access Denied
We have not been able to recognize your IP address
3.239.119.61
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.