DeepAI AI Chat
Log In Sign Up

On matrices potentially useful for tree codes

by   Pavel Pudlak, et al.

Motivated by a concept studied in [1], we consider a property of matrices over finite fields that generalizes triangular totally nonsingular matrices to block matrices. We show that (1) matrices with this property suffice to construct good tree codes and (2) a random block-triangular matrix over a field of quadratic size satisfies this property. We will also show that a generalization of this randomized construction yields codes over quadratic size fields for which the sum of the rate and minimum relative distance gets arbitrarily close to 1.


page 1

page 2

page 3

page 4


Superregular matrices over small finite fields

A trivially zero minor of a matrix is a minor having all its terms in th...

Codes over integers, and the singularity of random matrices with large entries

The prototypical construction of error correcting codes is based on line...

Construction of optimal Hermitian self-dual codes from unitary matrices

We provide an algorithm to construct unitary matrices over finite fields...

Proof of the tree module property for exceptional representations of the quiver 𝔼_6

This document (together with the ancillary file e6_proof.pdf) is an appe...

Power Hadamard matrices and Plotkin-optimal p-ary codes

A power Hadamard matrix H(x) is a square matrix of dimension n with entr...

Support Constrained Generator Matrices of Gabidulin Codes in Characteristic Zero

Gabidulin codes over fields of characteristic zero were recently constru...

Random Generator of Orthogonal Matrices in Finite Fields

We propose a superfast method for constructing orthogonal matrices M∈𝒪(n...