Related papers: The geometry of intersecting codes and application…
In the present paper we introduce and study finite point subsets of a special kind, called optimum distributions, in the n-dimensional unit cube. Such distributions are closely related with known (delta,s,n)-nets of low discrepancy. It…
We present a simplified exposition of some classical and modern results on graph drawings in the plane. These results are chosen so that they illustrate some spectacular recent higher-dimensional results on the border of topology and…
We introduce group crosscoders, an extension of crosscoders that systematically discover and analyse symmetrical features in neural networks. While neural networks often develop equivariant representations without explicit architectural…
Tensor codes are a generalisation of matrix codes. Such codes are defined as subspaces of order-r tensors for which the ambient space is endowed with the tensor-rank as a metric. A class of these codes was introduced by Roth, who also…
Discriminantal arrangements are hyperplane arrangements, which are generalized braid ones. They are constructed from given hyperplane arrangements, but their combinatorics are not invariant under combinatorial equivalence. However, it is…
We introduce a class of graphs with coloured edges to encode subsystems of the classical root systems, which in particular classify them up to equivalence. We further use the graphs to describe root-kernel intersections, as well as…
Motivated by problems arising in the complex analysis of perturbative quantum field theory, we investigate the homology of finite unions of certain non-degenerate quadratic affine hypersurfaces of complex dimension $n$ in general position.…
Union-free codes and disjunctive codes are two combinatorial structures, which are used in nonadaptive group testing to find a set of $d$ defective elements among $n$ samples by carrying out the minimal number of tests $t$. It is known that…
The study of holographic bulk-boundary dualities has led to the construction of novel quantum error correcting codes. Although these codes have shed new light on conceptual aspects of these dualities, they have widely been believed to lack…
In this paper the ensemble of codes formed by a serial concatenation of a repetition code with multiple accumulators connected through random interleavers is considered. Based on finite length weight enumerators for these codes, asymptotic…
While stabilizer tableaus have proven useful as a descriptive tool for additive quantum codes, they otherwise offer little guidance for concrete constructions or algorithm analysis. We introduce a representation of stabilizer codes as…
Due to their important applications to coding theory, cryptography, communications and statistics, combinatorial $t$-designs have been attracted lots of research interest for decades. The interplay between coding theory and $t$-designs has…
Convolutional codes are constructed, designed and analysed using row and/or block structures of unit algebraic schemes. Infinite series of such codes and of codes with specific properties are derived. Properties are shown algebraically and…
Constacyclic codes over finite fields are of theoretical importance as they are closely related to a number of areas of mathematics such as algebra, algebraic geometry, graph theory, combinatorial designs and number theory. However, the…
We present a case for the use of codes possessing algebraic closure properties - coset codes - in developing coding techniques and characterizing achievable rate regions for generic multi-terminal channels. In particular, we consider three…
A construction is proposed for linear connections on non-commutative algebras. The construction relies on a generalisation of the Leibnitz rules of commutative geometry and uses the bimodule structure of $\Omega^1$. A special role is played…
We consider 5d supersymmetric gauge theories with unitary groups in the $\Omega$-background and study codim-2/4 BPS defects supported on orthogonal planes intersecting at the origin along a circle. The intersecting defects arise upon…
We establish a connection between linear codes and hyperplane arrangements using the Thomas decomposition of polynomial systems and the resulting counting polynomial. This yields both a generalization and a refinement of the weight…
Minimal linear codes are algebraic objects which gained interest in the last twenty years, due to their link with Massey's secret sharing schemes. In this context, Ashikhmin and Barg provided a useful and a quite easy to handle sufficient…
A new construction is proposed for low density parity check (LDPC) codes using quadratic permutation polynomials over finite integer rings. The associated graphs for the new codes have both algebraic and pseudo-random nature, and the new…