English
Related papers

Related papers: Tangent Codes

200 papers

Let $f(u)$ be a polynomial of degree $m, m \geq 2,$ which splits into distinct linear factors over a finite field $\mathbb{F}_{q}$. Let $\mathcal{R}=\mathbb{F}_{q}[u]/\langle f(u)\rangle$ be a finite non-chain ring. In an earlier paper, we…

Information Theory · Computer Science 2018-05-25 Mokshi Goyal , Madhu Raka

We construct a topological invariant of algebraic plane curves, which is in some sense an adaptation of the linking number of knot theory. This invariant is shown to be a generalization of the I-invariant of line arrangements developed by…

Geometric Topology · Mathematics 2019-01-25 Benoît Guerville-Ballé , Jean-Baptiste Meilhan

Let X be a smooth complex projective variety of dimension n equipped with a very ample Hermitian line bundle L. In the first part of the paper, we show that if there exists a toric degeneration of X satisfying some natural hypotheses (which…

Algebraic Geometry · Mathematics 2015-04-10 Megumi Harada , Kiumars Kaveh

Let $X$ be a mildly singular Fano variety such that the tangent sheaf is a direct sum. We show that the direct factors are algebraically integrable, so the infinitesimal decomposition induces a product structure on a quasi-\'etale cover of…

Algebraic Geometry · Mathematics 2026-02-18 Andreas Höring

In this paper we present several classes of asymptotically good concatenated quantum codes and derive lower bounds on the minimum distance and rate of the codes. We compare these bounds with the best-known bound of…

Quantum Physics · Physics 2007-05-23 Hachiro Fujita

A "tensor space" is a vector space equipped with a finite collection of multi-linear forms. In previous work, we showed that (for each signature) there exists a universal homogeneous tensor space, which is unique up to isomorphism. Here we…

Representation Theory · Mathematics 2024-07-30 Nate Harman , Andrew Snowden

This paper is a general survey of literature on Goppa-type codes from higher dimensional algebraic varieties. The construction and several techniques for estimating the minimum distance are described first. Codes from various classes of…

Information Theory · Computer Science 2008-02-19 John B. Little

We study properties of rank metric and codes in rank metric over finite fields. We show that in rank metric perfect codes do not exist. We derive an existence bound that is the equivalent of the Gilbert--Varshamov bound in Hamming metric.…

Discrete Mathematics · Computer Science 2007-07-13 P. Loidreau

We study sheaf codes, a type of linear codes with a fixed hierarchical collection of local codes, viewed as a sheaf of vector spaces on a finite topological space we call coded space. Many existing codes, such as tensor product codes,…

Information Theory · Computer Science 2024-03-07 Pavel Panteleev , Gleb Kalachev

Sum-rank Hamming codes are introduced in this work. They are essentially defined as the longest codes (thus of highest information rate) with minimum sum-rank distance at least $ 3 $ (thus one-error-correcting) for a fixed redundancy $ r $,…

Information Theory · Computer Science 2021-01-13 Umberto Martínez-Peñas

We show that the dimension of the set of limits of tangent spaces along a subvariety at an irreducible isolated singularity is one less than the dimension of the subvariety itself.

Algebraic Geometry · Mathematics 2015-05-06 Achim Hennings

A new lower bound on the minimum Hamming distance of linear quasi-cyclic codes over finite fields is proposed. It is based on spectral analysis and generalizes the Semenov- Trifonov bound in a similar way as the Hartmann-Tzeng bound extends…

Information Theory · Computer Science 2016-11-15 Alexander Zeh , San Ling

We develop a theory of nearby and vanishing cycles in the context of finite-coefficient Zariski-constructible sheaves over a non-archimedean field which is non-trivially valued, complete, algebraically closed, and of mixed characteristic or…

Algebraic Geometry · Mathematics 2025-04-24 Tong Zhou

We find a remarkably simple relationship between the following two models of the tangent space to the Universal Teichm\"uller Space: (1) The real-analytic model consisting of Zygmund class vector fields on the unit circle; (2) The…

alg-geom · Mathematics 2008-02-03 Subhashis Nag

We introduce sequential and parallel decoders for quantum Tanner codes. When the Tanner code construction is applied to a sufficiently expanding square complex with robust local codes, we obtain a family of asymptotically good quantum…

Quantum Physics · Physics 2022-12-09 Anthony Leverrier , Gilles Zémor

We study fine structural properties related to the interior regularity of $m$-dimensional area minimizing currents mod$(q)$ in arbitrary codimension. We show: (i) the set of points where at least one tangent cone is translation invariant…

Analysis of PDEs · Mathematics 2024-06-28 Camillo De Lellis , Paul Minter , Anna Skorobogatova

We construct extended TQFTs associated to Rozansky--Witten models with target manifolds $T^*\mathbb{C}^n$. The starting point of the construction is the 3-category whose objects are such Rozansky--Witten models, and whose morphisms are…

Mathematical Physics · Physics 2025-04-15 Ilka Brunner , Nils Carqueville , Daniel Roggenkamp

A general class of the almost instantaneous fixed-to-variable-length (AIFV) codes is proposed, which contains every possible binary code we can make when allowing finite bits of decoding delay. The contribution of the paper lies in the…

Information Theory · Computer Science 2023-09-08 Ryosuke Sugiura , Yutaka Kamamoto , Takehiro Moriya

This paper is a continuation of the previous paper of the author[M]. We show that an affine deformation space of a hyperbolic surface of type (g,b) can be parametrized by Margulis invariants and affine twist parameters with a certain…

Geometric Topology · Mathematics 2016-06-21 Takayuki Masuda

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…

Combinatorics · Mathematics 2007-07-16 M. M. Skriganov