Related papers: Ranks and Kernels of Codes from Generalized Hadama…
Let $\mathbb{F}_q$ denote the finite field with $q=p^\lambda$ elements. Maximum Rank-metric codes (MRD for short) are subsets of $M_{m\times n}(\mathbb{F}_q)$ whose number of elements attains the Singleton-like bound. The first MRD codes…
In this work we develop a geometric approach to the study of rank metric codes. Using this method, we introduce a simpler definition for generalized rank weight of linear codes. We give a complete classification of constant rank weight code…
We determine the generic complete eigenstructures for $n \times n$ complex symmetric matrix polynomials of odd grade $d$ and rank at most $r$. More precisely, we show that the set of $n \times n$ complex symmetric matrix polynomials of odd…
We study the existence and construction of circulant matrices $C$ of order $n\geq2$ with diagonal entries $d\geq0$, off-diagonal entries $\pm1$ and mutually orthogonal rows. These matrices generalize circulant conference ($d=0$) and…
We give some very interesting matrices which are orthogonal over groups and, as far as we know, referenced, but in fact undocumented. This note is not intended to be published but available for archival reasons.
We present the theory of linear rank-metric codes from the point of view of their fundamental parameters. These are: the minimum rank distance, the rank distribution, the maximum rank, the covering radius, and the field size. The focus of…
From the generating matrix of a linear code one can construct a sequence of generalized star configurations which are strongly connected to the generalized Hamming weights and the underlying matroid of the code. When the code is MDS, the…
We consider the problem of exact low-rank matrix completion from a geometric viewpoint: given a partially filled matrix M, we keep the positions of specified and unspecified entries fixed, and study how the minimal completion rank depends…
We explore a notion of bent sequence attached to the data consisting of an Hadamard matrix of order $n$ defined over the complex $q^{th}$ roots of unity, an eigenvalue of that matrix, and a Galois automorphism from the cyclotomic field of…
We introduce a simple logical inference structure we call a $\textsf{spanoid}$ (generalizing the notion of a matroid), which captures well-studied problems in several areas. These include combinatorial geometry, algebra (arrangements of…
We classify binary completely regular codes of length $m$ with minimum distance $\delta$ for $(m,\delta)=(12,6)$ and $(11,5)$. We prove that such codes are unique up to equivalence, and in particular, are equivalent to certain Hadamard…
The generalized Hamming weights of a linear code have been extensively studied since Wei first use them to characterize the cryptography performance of a linear code over the wire-tap channel of type II. In this paper, we investigate the…
The matrix form of the presentation of the genetic code is described as the cognitive form to analyze structures of the genetic code. A similar matrix form is utilized in the theory of signal processing. The Kronecker family of the genetic…
Let $q$ be a prime power and let $\mathcal{R}=\mathbb{F}_{q}[u_1,u_2, \cdots, u_k]/\langle f_i(u_i),u_iu_j-u_ju_i\rangle$ be a finite non-chain ring, where $f_i(u_i), 1\leq i \leq k$ are polynomials, not all linear, which split into…
We study the maximum absolute value of the determinant of matrices with entries in the set of $\ell$-th roots of unity; this is a generalization of $D$-optimal designs and Hadamard's maximal determinant problem, which involves $\pm 1$…
Let $\|A\|_{p,q}$ be the norm induced on the matrix $A$ with $n$ rows and $m$ columns by the H\"older $\ell_p$ and $\ell_q$ norms on $R^n$ and $R^m$ (or $C^n$ and $C^m$), respectively. It is easy to find an upper bound for the ratio…
In this paper we consider completely regular codes, obtained from perfect (Hamming) codes by lifting the ground field. More exactly, for a given perfect code C of length n=(q^m-1)/(q-1) over F_q with a parity check matrix H_m, we define a…
In this paper, we investigate the encoding circuit size of Hamming codes and Hadamard codes. To begin with, we prove the exact lower bound of circuit size required in the encoding of (punctured)~Hadamard codes and (extended)~Hamming codes.…
Generalized diagonal matrices are matrices that have two ladders of entries that are zero in the upper right and bottom left corners. The minors of generic generalized diagonal matrices have square-free initial ideals. We give a description…
Hadamard matrices of order $n$ are conjectured to exist whenever $n$ is $1$, $2$, or a multiple of $4$; a similar conjecture exists for skew Hadamard matrices. We provide constructions covering orders $\le 1208$ of all known Hadamard and…