Related papers: Three Combinatorial Perspectives on Minimal Codes
Subspace codes are collections of subspaces of a projective space such that any two subspaces satisfy a pairwise minimum distance criterion. Recent results have shown that it is possible to construct optimal $(5,3)$ subspace codes from…
Using polynomial equations to model combinatorial problems has been a popular tool both in computational combinatorics as well as an approach to proving new theorems. In this paper, we look at several combinatorics problems modeled by…
By exploiting the connection between scattered $\mathbb{F}_q$-subspaces of $\mathbb{F}_{q^m}^3$ and minimal non degenerate $3$-dimensional rank metric codes of $\mathbb{F}_{q^m}^{n}$, $n \geq m+2$, described in [2], we will exhibit a new…
We characterize the smallest finite spaces with the same homotopy groups of the spheres. Similarly, we describe the minimal finite models of any finite graph. We also develop new combinatorial techniques based on finite spaces to study…
This paper investigates properties of concatenated polar codes and their potential applications. We start with reviewing previous work on stopping set analysis for conventional polar codes, which we extend in this paper to concatenated…
Minimal multicast networks are fascinating and efficient combinatorial objects, where the removal of a single link makes it impossible for all receivers to obtain all messages. We study the structure of such networks, and prove some…
In this article we extend the theory of the binary codes (the strict code $\mathcal{K}$ and the extended code $\mathcal{K}'$), associated to a projective nodal surface, to a coding theory for normal surfaces, with special consideration of…
In the past few years, linear codes with few weights and their weight analysis have been widely studied. In this paper, we further investigate a class of two-weight or three-weight linear codes from defining sets and determine their weight…
The simple interpretation of the minimum distance of a linear code obtained by De Boer and Pellikaan, and later refined by the second author, is further developed through the study of various finitely generated graded modules. We use the…
Motivated by the study of matrix elimination orderings in combinatorial scientific computing, we utilize graph sketching and local sampling to give a data structure that provides access to approximate fill degrees of a matrix undergoing…
The aim of this survey is to outline the state of the art in research on a class of linearized polynomials with coefficients over finite fields, known as scattered polynomials. These have been studied in several contexts, such as in [A.…
We investigate two fundamental questions intersecting coding theory and combinatorial geometry, with emphasis on their connections. These are the problem of computing the asymptotic density of MRD codes in the rank metric, and the Critical…
In this paper, we study three applications of recursion to problems in coding and random permutations. First, we consider locally recoverable codes with partial locality and use recursion to estimate the minimum distance of such codes. Next…
We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…
The evaluation of the minimum distance of linear block codes remains an open problem in coding theory, and it is not easy to determine its true value by classical methods, for this reason the problem has been solved in the literature with…
In this paper, we study the minimum distances of binary linear codes with parity check matrices formed from subset inclusion matrices $W_{t,n,k}$, representing $t$-element subsets versus $k$-element subsets of an $n$-element set. We provide…
In this paper, we consider the affine variety codes obtained evaluating the polynomials $by=a_kx^k+\dots+a_1x+a_0$, $b,a_i\in\mathbb{F}_{q^r}$, at the affine $\F_{q^r}$-rational points of the Norm-Trace curve. In particular, we investigate…
We use Sidon sets to present an elementary method to study some combinatorial problems in finite fields, such as sum product estimates, solubility of some equations and distribution of sequences in small intervals. We obtain classic and…
We apply ideas from the theory of limits of dense combinatorial structures to study order types, which are combinatorial encodings of finite point sets. Using flag algebras we obtain new numerical results on the Erd\H{o}s problem of finding…
We consider linear error correcting codes associated to higher dimensional projective varieties defined over a finite field. The problem of determining the basic parameters of such codes often leads to some interesting and difficult…