English
Related papers

Related papers: The dual geometry of Hermitian two-point codes

200 papers

Hermitian linear complementary dual codes are linear codes whose intersection with their Hermitian dual code is trivial. The largest minimum weight among quaternary Hermitian linear complementary dual codes of dimension $2$ is known for…

Combinatorics · Mathematics 2020-04-21 Keita Ishizuka

Interest in the hulls of linear codes has been growing rapidly. More is known when the inner product is Euclidean than Hermitian. A shift to the latter is gaining traction. The focus is on a code whose Hermitian hull dimension and dual…

Information Theory · Computer Science 2025-12-22 Lin Sok , Martianus Frederic Ezerman , Ling San

In this article, the minimum distance of the dual $C^{\bot}$ of a functional code $C$ on an arbitrary dimensional variety $X$ over a finite field $\F_q$ is studied. The approach consists in finding minimal configurations of points on $X$…

Algebraic Geometry · Mathematics 2013-09-18 A. Couvreur

We investigate point-line geometries whose singular subspaces correspond to binary equidistant codes. The main result is a description of automorphisms of these geometries. In some important cases, automorphisms induced by non-monomial…

Combinatorics · Mathematics 2024-07-12 Mark Pankov , Krzysztof Petelczyc , Mariusz Zynel

In the present paper, we show that if the dimension of an arbitrary algebraic geometry code over a finite field of even characters is slightly less than half of its length, then it is equivalent to an Euclidean self-orthogonal code.…

Information Theory · Computer Science 2013-08-19 Lingfei Jin , Chaoping Xing

We investigate multi-point algebraic geometric codes defined from curves related to the generalized Hermitian curve introduced by Alp Bassa, Peter Beelen, Arnaldo Garcia, and Henning Stichtenoth. Our main result is to find a basis of the…

Information Theory · Computer Science 2015-05-21 Chuangqiang Hu , Chang-An Zhao

Sarvepalli and Klappenecker showed how classical one-point codes on the Hermitian curve can be used to construct quantum codes. Homma and Kim determined the parameters of a larger family of codes, the two-point codes. In quantum…

Information Theory · Computer Science 2011-02-18 Martianu Frederic Ezerman , Radoslav Kirov

In the realm of algebraic geometric (AG) codes, characterizing dual codes has long been a challenging task. In this paper we introduces a generalized criterion to characterize self-orthogonality of AG codes based on residues, drawing upon…

Information Theory · Computer Science 2025-06-03 Puyin Wang , Jinquan Luo

It is known that the Hermitian varieties are codewords in the code defined by the points and hyperplanes of the projective spaces $PG(r,q^2)$. In finite geometry, also quasi-Hermitian varieties are defined. These are sets of points of…

Combinatorics · Mathematics 2017-06-22 A. Aguglia , D. Bartoli , L. Storme , Zs. Weiner

In this paper, two classes of quantum MDS codes are constructed. The main tools are multiplicative structures on finite fields. Carefully choosing different cosets can make the corresponding generalized Reed-Solomon codes Hermitian…

Information Theory · Computer Science 2024-10-24 Puyin Wang , Jinquan Luo

Convex algebraic geometry concerns the interplay between optimization theory and real algebraic geometry. Its objects of study include convex semialgebraic sets that arise in semidefinite programming and from sums of squares. This article…

Optimization and Control · Mathematics 2010-06-28 Philipp Rostalski , Bernd Sturmfels

In this paper, we consider the hull of an algebraic geometry code, meaning the intersection of the code and its dual. We demonstrate how codes whose hulls are algebraic geometry codes may be defined using only rational places of Kummer…

Information Theory · Computer Science 2024-02-06 Eduardo Camps , Hiram H. López , Gretchen L. Matthews

For a given curve X and divisor class C, we give lower bounds on the degree of a divisor A such that A and A-C belong to specified semigroups of divisors. For suitable choices of the semigroups we obtain (1) lower bounds for the size of a…

Number Theory · Mathematics 2008-10-17 Iwan M. Duursma , Seungkook Park

Algebraic geometry codes on the Hermitian curve have been the subject of several papers, since they happen to have good performances and large automorphism groups. Here, those arising from the Singer cycle of the Hermitian curve are…

Algebraic Geometry · Mathematics 2026-01-05 Gábor Korchmáros , Federico Romaniello , Valentino Smaldore

We introduce the first geometric construction of codes in the sum-rank metric, which we called linearized Algebraic Geometry codes, using quotients of the ring of Ore polynomials with coefficients in the function field of an algebraic…

Algebraic Geometry · Mathematics 2024-05-30 Elena Berardini , Xavier Caruso

We prove a new bound for the minimum distance of geometric Goppa codes that generalizes two previous improved bounds. We include examples of the bound to one and two point codes over both the Suzuki and Hermitian curves.

Number Theory · Mathematics 2007-05-23 Benjamin Lundell , Jason McCullough

In this paper, we study the enumerative and asymptotic properties related to Hermitian $\ell$-complementary codes on the unitary space over $\F_{q^2}$. We provide some closed form expressions for the counting formulas of Hermitian…

Information Theory · Computer Science 2025-12-17 Jiabin Wang , Jinquan Luo

The self-dual double copy is further explored. In previous work, it has been shown that hyper-Hermitian manifolds also have associated the self-dual gauge theories via Kerr-Schild double copy. The self-dual double copy is generalized in the…

High Energy Physics - Theory · Physics 2024-11-22 E. Chacón , H. García-Compeán , G. Robles

In this paper we introduce and study line Hermitian Grassmann codes as those subcodes of the Grassmann codes associated to the $2$-Grassmannian of a Hermitian polar space defined over a finite field of square order. In particular, we…

Combinatorics · Mathematics 2025-10-20 Ilaria Cardinali , Luca Giuzzi

Security of linear ramp secret sharing schemes can be characterized by the relative generalized Hamming weights of the involved codes. In this paper we elaborate on the implication of these parameters and we devise a method to estimate…

Information Theory · Computer Science 2015-02-04 Olav Geil , Stefano Martin , Ryutaroh Matsumoto , Diego Ruano , Yuan Luo