Related papers: A new coding theory, for normal surfaces, and ADE …
Intersecting codes are linear codes where every two nonzero codewords have non-trivially intersecting support. In this article we expand on the theory of this family of codes, by showing that nondegenerate intersecting codes correspond to…
There exists a well established differential topological theory of singularities of ordinary differential equations. It has mainly studied scalar equations of low order. We propose an extension of the key concepts to arbitrary systems of…
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.…
The general subject considered in this thesis is a recently discovered coding technique, polar coding, which is used to construct a class of error correction codes with unique properties. In his ground-breaking work, Ar{\i}kan proved that…
PhD thesis investigating homological quantum codes derived from curved and higher dimensional geometries. In the first part we will consider closed surfaces with constant negative curvature. We show how such surfaces can be constructed and…
We introduce the notion of "binary" positive and complex geometries, giving a completely rigid geometric realization of the combinatorics of generalized associahedra attached to any Dynkin diagram. We also define open and closed "cluster…
Any ruled surface in Euclidean 3-space is described as a curve of unit dual vectors in the algebra of dual quaternions (=the even Clifford algebra of type (0,3,1)). Combining this classical framework and Singularity Theory, we characterize…
In this paper we propose the concept of formal desingularizations as a substitute for the resolution of algebraic varieties. Though a usual resolution of algebraic varieties provides more information on the structure of singularities there…
Decoding algorithms are essential to fault-tolerant quantum-computing architectures. In this perspective we explore decoding algorithms for the surface code; a prototypical quantum low-density parity-check code that underlies many of the…
In Monoidal Computer I, we introduced a categorical model of computation where the formal reasoning about computability was supported by the simple and popular diagrammatic language of string diagrams. In the present paper, we refine and…
We provide a theoretical study of Algebraic Geometry codes constructed from abelian surfaces defined over finite fields. We give a general bound on their minimum distance and we investigate how this estimation can be sharpened under the…
We suggest an enhancement to structural coding through the use of (a) causally bound codes, (b) basic constructs of graph theory and (c) statistics. As is the norm with structural coding, the codes are collected into categories. The…
We solve the problem on flat extensions of a generic surface with boundary in Euclidean 3-space, relating it to the singularity theory of the envelope generated by the boundary. We give related results on Legendre surfaces with boundaries…
General error locator polynomials are polynomials able to decode any correctable syndrome for a given linear code. Such polynomials are known to exist for all cyclic codes and for a large class of linear codes. We provide some decoding…
The surface code is a two-dimensional topological code with code parameters that scale optimally with the number of physical qubits, under the constraint of two-dimensional locality. In three spatial dimensions an analogous simple yet…
We construct algebraic surfaces with a large number of type A singularities. Bivariate polynomials presented in previous works for the construction of nodal surfaces and certain families of Belyi polynomials are used. In some cases explicit…
A generalization of the polar coding scheme called mixed-kernels is introduced. This generalization exploits several homogeneous kernels over alphabets of different sizes. An asymptotic analysis of the proposed scheme shows that its…
We discuss the similarity of the degeneration structure of the genetic code with a pure number theoretic -- ``divisors code.'' The most interesting thing about our observation is not that there is a connection between number theory and the…
A general strategy is given for the classification of graphs of rational surface singularities. For each maximal rational double point configuration we investigate the possible multiplicities in the fundamental cycle. We classify completely…
Nowadays there are several classes of constrained codes intended for different applications. The following two large classes can be distinguished. The first class contains codes with local constraints; for example, the source data must be…