Related papers: Error-Correcting Codes on Projective Bundles over …
We study the logarithmic vector bundles associated to arrangements of smooth irreducible curves with small degree on the blow-up of the projective plane at one point. We then investigate whether they are Torelli arrangements, that is, they…
Motivated by a question of Erd\H{o}s on blocking sets in a projective plane that intersect every line only a few times, several authors have used unions of algebraic curves to construct such sets in $\mathbb{P}^2(\mathbb{F}_q)$. In this…
We investigate the logarithmic bundles associated to arrangements of hypersurfaces with a fixed degree in a smooth projective variety. We then specialize to the case when the variety is a quadric hypersurface and a multiprojective space to…
We construct integer error-correcting codes and covering codes for the limited-magnitude error channel with more than one error. The codes are lattices that pack or cover the space with the appropriate error ball. Some of the constructions…
We propose a new strategy to decode color codes, which is based on the projection of the error onto three surface codes. This provides a method to transform every decoding algorithm of surface codes into a decoding algorithm of color codes.…
Coding in the projective space has received recently a lot of attention due to its application in network coding. Reduced row echelon form of the linear subspaces and Ferrers diagram can play a key role for solving coding problems in the…
We describe a computationally-efficient heuristic algorithm based on a renormalization-group procedure which aims at solving the problem of finding minimal surface given its boundary (curve) in any hypercubic lattice of dimension $D>2$. We…
For any number field k, upper bounds are established for the number of k-rational points of bounded height on non-singular del Pezzo surfaces defined over k, which are equipped with suitable conic bundle structures over k.
In the present paper, we focus on a weighted version of the Bounded Negativity Conjecture which predicts that for every smooth projective surface in characteristic zero the self-intersection numbers of reduced and irreducible curves are…
For line bundles on arithmetic varieties we construct height functions using arithmetic intersection theory. In the case of an arithmetic surface, generically of genus g, for line bundles of degree g equivalence is shown to the height on…
Phased burst errors (PBEs) are bursts of errors occurring at one or more known locations. The correction of PBEs is a classical topic in coding theory, with prominent applications such as the design of array codes for memory systems or…
In this paper we give lower bounds for the minimum distance of evaluation codes constructed from complete intersections in toric varieties. This generalizes the results of Gold-Little-Schenck and Ballico-Fontanari who considered evaluation…
Minimal linear codes are in one-to-one correspondence with special types of blocking sets of projective spaces over a finite field, which are called strong or cutting blocking sets. In this paper we prove an upper bound on the minimal…
We study analytically and numerically decoding properties of finite rate hypergraph-product quantum LDPC codes obtained from random (3,4)-regular Gallager codes, with a simple model of independent X and Z errors. Several non-trival lower…
Let $L$ be a very ample line bundle on a smooth curve $C$ of genus $g$ with $\frac{3g+3}{2}<\deg L\le 2g-5$. Then $L$ is normally generated if $\deg L>\max\{2g+2-4h^1(C,L), 2g-\frac{g-1}{6}-2h^1(C,L)\}$. Let $C$ be a triple covering of…
We give a recursive decoding algorithm for projective Reed-Muller codes making use of a decoder for affine Reed-Muller codes. We determine the number of errors that can be corrected in this way, which is the current highest for decoders of…
Analysis of motion algorithms for autonomous systems operating under variable external conditions leads to the concept of parametrized topological complexity \cite{CFW}. In \cite{CFW}, \cite{CFW2} the parametrized topological complexity was…
We derive a linear programming bound on the maximum cardinality of error-correcting codes in the sum-rank metric. Based on computational experiments on relatively small instances, we observe that the obtained bounds outperform all…
A conjecture of Bondal-Polishchuk states that, in particular for the bounded derived category of coherent sheaves on a smooth projective variety, the action of the braid group on full exceptional collections is transitive up to shifts. We…
The $p$-ary code associated with the incidence structure of points and $t$-spaces in a projective space $\mathrm{PG}(m,q)$, where $q=p^h$, is the $\mathbb{F}_p$-subspace generated by the incidence vectors of the blocks of this design. The…