Related papers: On Minimal Pseudo-Codewords of Tanner Graphs from …
Mock threshold graphs are a simple generalization of threshold graphs that, like threshold graphs, are perfect graphs. Our main theorem is a characterization of mock threshold graphs by forbidden induced subgraphs. Other theorems…
The main purpose of the note is to exclude the existence of certain submaximal curves in fake projective planes. This will lead to lower bounds on multipoint Seshadri constants of `fake' $\mathcal{O}(1)$ on fake projective planes.
A method for construction of polar subcodes is presented, which aims on minimization of the number of low-weight codewords in the obtained codes, as well as on improved performance under list or sequential decoding. Simulation results are…
We classify all possible limits of families of translates of a fixed, arbitrary complex plane curve. We do this by giving a set-theoretic description of the projective normal cone (PNC) of the base scheme of a natural rational map,…
Given an edge-weighted graph $G$ with a set $Q$ of $k$ terminals, a mimicking network is a graph with the same set of terminals that exactly preserves the sizes of minimum cuts between any partition of the terminals. A natural question in…
In this paper we study the dual codes of a wide family of evaluation codes on norm-trace curves. We explicitly find out their minimum distance and give a lower bound for the number of their minimum-weight codewords. A general geometric…
Cages, defined as regular graphs with minimum number of nodes for a given girth, are well-studied in graph theory. Trapping sets are graphical structures responsible for error floor of low-density parity-check (LDPC) codes, and are well…
We characterize the topological non-cancellative cones that are expressible as projective limits of finite powers of $[0,\infty]$. These are also the cones of lower semicontinuous extended-valued traces on AF C*-algebras. Our main result…
The setting of projective systems can be used to study the parameters of a projective linear code $\mathcal{C}$. This can be done by considering the intersections of the point set $\Omega$ defined by the columns of a generating matrix for…
In this paper, we study and characterise certain blocking sets in generalised polygons. This will allow us to derive new results about the minimum weight and minimum weight code words in the code generated by the rows of the incidence…
Let $C_{n-1}(n,q)$ be the code arising from the incidence of points and hyperplanes in the Desarguesian projective space PG($n,q$). Recently, Polverino and Zullo proved that within this code, all non-zero code words of weight at most…
Quantum Tanner codes are a class of quantum low-density parity-check codes that provably display a linear minimum distance and a constant encoding rate in the asymptotic limit. When built from left--right Cayley complexes, they can be…
Quantum information is fragile and must be protected by a quantum error-correcting code for large-scale practical applications. Recently, highly efficient quantum codes have been discovered which require a high degree of spatial…
It is an important fact that extremal discrete structures -- that is, discrete structures of maximal size among those that avoid certain configurations -- exhibit strong pseudorandom behavior. We present instances of this phenomenon in the…
We give a recursive construction for projective Reed-Muller codes in terms of affine Reed-Muller codes and projective Reed-Muller codes in fewer variables. From this construction, we obtain the dimension of the subfield subcodes of…
The results of [1,2] on linear homogeneous two-weight codes over finite Frobenius rings are exended in two ways: It is shown that certain non-projective two-weight codes give rise to strongly regular graphs in the way described in [1,2].…
The minimum weight of the code generated by the incidence matrix of points versus lines in a projective plane has been known for over 50 years. Surprisingly, finding the minimum weight of the dual code of projective planes of non-prime…
In this short survey we concern ourselves with minimal codes, a classical object in coding theory. We will explain the relation between minimal codes and various other mathematical domains, in particular with finite projective geometry.…
We present lower bounds on the minimum pseudocodeword effective Euclidean distance (or minimum "pseudodistance") for coded modulation systems using linear codes with $q$-ary phase-shift keying (PSK) modulation over the additive white…
In general the problem of finding a miminum spanning tree for a weighted directed graph is difficult but solvable. There are a lot of differences between problems for directed and undirected graphs, therefore the algorithms for undirected…