Related papers: Multi-point Codes over Kummer Extensions
We present a novel error correcting code and decoding algorithm which have construction similar to expander codes. The code is based on a bipartite graph derived from the subsumption relations of finite projective geometry, and Reed-Solomon…
We prove the existence of "half-plane differentials" with prescribed local data on any Riemann surface. These are meromorphic quadratic differentials with higher-order poles which have an associated singular flat metric isometric to a…
This text contains some notes on the Griesmer bound. In particular, we give a geometric proof of the Griesmer bound for the generalized weights and show that a Solomon--Stiffler type construction attains it if the minimum distance is…
The explicit construction of function fields tower with many rational points relative to the genus in the tower play a key role for the construction of asymptotically good algebraic-geometric codes. In 1997 Garcia, Stichtenoth and Thomas…
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…
Equidistant codes over vector spaces are considered. For $k$-dimensional subspaces over a large vector space the largest code is always a sunflower. We present several simple constructions for such codes which might produce the largest…
Additive codes may have better parameters than linear codes. However, still very few cases are known and the explicit construction of such codes is a challenging problem. Here we show that a Griesmer type bound for the length of additive…
We study additive quaternary codes whose parameters are close to those of the extended cyclic [12; 6; 6]4-code or to the quaternary linear codes generated by the elliptic quadric in PG(3; 4) or its dual. In particular we characterize those…
Rank-metric codes have been a central topic in coding theory due to their theoretical and practical significance, with applications in network coding, distributed storage, crisscross error correction, and post-quantum cryptography. Recent…
Subspace codes form the appropriate mathematical setting for investigating the Koetter-Kschischang model of fault-tolerant network coding. The Main Problem of Subspace Coding asks for the determination of a subspace code of maximum size…
A meromorphic quadratic differential on a punctured Riemann surface induces horizontal and vertical measured foliations with pole-singularities. In a neighborhood of a pole such a foliation comprises foliated strips and half-planes, and its…
Ribbon graphs embedded on a Riemann surface provide a useful way to describe the double line Feynman diagrams of large N computations and a variety of other QFT correlator and scattering amplitude calculations, e.g in MHV rules for…
We study arithmetic progressions of squares over quadratic extensions of number fields. Using a method inspired by an approach of Mordell, we characterize such progressions as quadratic points on a genus $5$ curve. Specifically, we…
Additive codes and some nonadditive codes use the single and multiple invariant subspaces of the stabilizer G, respectively, to construct quantum codes, so the selection of the invariant subspaces is a key problem. In this paper, I provide…
Based on ideas of K\"otter and Kschischang we use constant dimension subspaces as codewords in a network. We show a connection to the theory of q-analogues of a combinatorial designs, which has been studied in Braun, Kerber and Laue as a…
Given a prime $p$, a number field $\K$ and a finite set of places $S$ of $\K$, let $\K_S$ be the maximal pro-$p$ extension of $\K$ unramified outside $S$. Using the Golod-Shafarevich criterion one can often show that $\K_S/\K$ is infinite.…
In this paper we treat several topics regarding numerical Weierstrass semigroups and the theory of Algebraic Geometric Codes associated to a pair $(X, P)$, where $X$ is a projective curve defined over the algebraic closure of the finite…
This work is a survey on completely regular codes. Known properties, relations with other combinatorial structures and constructions are stated. The existence problem is also discussed and known results for some particular cases are…
In this text we develop the formalism of products and powers of linear codes under componentwise multiplication. As an expanded version of the author's talk at AGCT-14, focus is put mostly on basic properties and descriptive statements that…
Let $D$ be a division algebra, finite-dimensional over its center, and $R=D[t;\sigma,\delta]$ a skew polynomial ring. Using skew polynomials $f\in R$, we construct division algebras and a generalization of maximum rank distance codes…