English
Related papers

Related papers: Linear Codes with Certain Dimension of Hermitian H…

200 papers

Motivated by applications to the theory of rank-metric codes, we study the problem of estimating the number of common complements of a family of subspaces over a finite field in terms of the cardinality of the family and its intersection…

Combinatorics · Mathematics 2022-01-19 Anina Gruica , Alberto Ravagnani

Considering a determinantal point process on the real line, we establish a connection between the sine-kernel asymptotics for the correlation kernel and the CLT for mesoscopic linear statistics. This implies universality of mesoscopic…

Probability · Mathematics 2016-09-13 Gaultier Lambert

We establish quantitative asymptotic behavior of positive solutions of a family of nonlinear elliptic equations on the half cylinder near the end. This unifies the study of isolated singularities of some semilinear elliptic equations, such…

Analysis of PDEs · Mathematics 2020-10-13 Shan Chen , Zixiao Liu

In this paper, we show how to expand Euclidean/Hermitian self-orthogonal code preserving their orthogonal property. Our results show that every $k$-dimension Hermitian self-orthogonal code is contained in a $(k+1)$-dimensional Hermitian…

Information Theory · Computer Science 2025-11-25 Jon-Lark Kim , Hongwei Liu , Jinquan Luo

Self-dual MDS and NMDS codes over finite fields are linear codes with significant combinatorial and cryptographic applications. In this paper, firstly, we investigate the duality properties of generalized twisted Reed-Solomon (abbreviated…

Information Theory · Computer Science 2022-02-24 Guanmin Guo , Ruihu Li , Yang Liu , Hao Song

In this paper we study the asymptotic behavior of solutions to an elliptic equation near the singularity of an inverse square potential with a coefficient related to the best constant for the Hardy inequality. Due to the presence of a…

Analysis of PDEs · Mathematics 2012-09-24 Veronica Felli , Alberto Ferrero

In this paper, we construct codes for local recovery of erasures with high availability and constant-bounded rate from the Hermitian curve. These new codes, called Hermitian-lifted codes, are evaluation codes with evaluation set being the…

Information Theory · Computer Science 2024-02-06 Hiram H. López , Beth Malmskog , Gretchen L Matthews , Fernando Piñero-González , Mary Wootters

Computing the electronic structure of incommensurate materials is a central challenge in condensed matter physics, requiring efficient ways to approximate spectral quantities such as the density of states (DoS). In this paper, we…

Mathematical Physics · Physics 2025-12-09 Eric Cancès , Daniel Massatt , Long Meng , Étienne Polack , Xue Quan

We construct new stabilizer quantum error-correcting codes from generalized monomial-Cartesian codes. Our construction uses an explicitly defined twist vector, and we present formulas for the minimum distance and dimension. Generalized…

Information Theory · Computer Science 2024-10-25 Beatriz Barbero-Lucas , Fernando Hernando , Helena Martín-Cruz , Gary McGuire

We obtain an asymptotic formula in q for the number of MDS codes of length n and dimension k over a finite field with q elements.

Information Theory · Computer Science 2013-11-05 Krishna Kaipa

This paper introduces new constructions of sum-rank metric codes derived from algebraic function fields, as existing results on such codes remain limited. A major challenge lies in the determination of their parameters. We address this…

Information Theory · Computer Science 2025-12-16 Zhu Yunlong , Zhao Chang-An

Two families of complementary codes over finite fields $\mathbb{F}_q$ are studied, where $q=r^2$ is square: i) Hermitian complementary dual linear codes, and ii) trace Hermitian complementary dual subfield linear codes. Necessary and…

Information Theory · Computer Science 2017-10-13 Kriangkrai Boonniyom , Somphong Jitman

The length function $\ell_2(r,R)$ is the smallest length of a binary linear code with codimension (redundancy) $r$ and covering radius $R$. We obtain the following new upper bounds on $\ell_2(r,R)$, which yield a decrease $\Delta(r,R)$…

Combinatorics · Mathematics 2025-11-10 Alexander A. Davydov , Stefano Marcugini , Fernanda Pambianco

The Galois hull of a linear code is the intersection of itself and its Galois dual code, which has aroused the interest of researchers in these years. In this paper, we study Galois hulls of linear codes. Firstly, the symmetry of the…

Information Theory · Computer Science 2023-01-12 Yang Li , Shixin Zhu

Let $n_k(s)$ be the maximal length $n$ such that a quaternary additive $[n,k,n-s]_4$-code exists. We solve a natural asymptotic problem by determining the lim sup $\lambda_k$ of $n_k(s)/s,$ and the smallest value of $s$ such that…

Combinatorics · Mathematics 2023-10-19 Jürgen Bierbrauer , Stefano Marcugini , Fernanda Pambianco

The paper is devoted to the study of asymptotic behavior of solutions for nonlocal elliptic problems in weighted spaces. We deal with the most difficult case where the support of nonlocal terms intersects with the boundary of a plane…

Analysis of PDEs · Mathematics 2014-04-18 Pavel Gurevich

We investigate the global density of zeros of generalized Hermite orthogonal polynomials, subject to certain truncated conditions on its weight. We shall given explicitly the global density of zeros under some asymptotic conditions on the…

Probability · Mathematics 2014-11-26 Mohamed Bouali

We prove that there is a Hermitian self-orthogonal $k$-dimensional truncated generalised Reed-Solomon code of length $n \leqslant q^2$ over ${\mathbb F}_{q^2}$ if and only if there is a polynomial $g \in {\mathbb F}_{q^2}$ of degree at most…

Information Theory · Computer Science 2021-12-24 Simeon Ball , Ricard Vilar

Symmetric elliptic integrals, which have been used as replacements for Legendre's integrals in recent integral tables and computer codes, are homogeneous functions of three or four variables. When some of the variables are much larger than…

Classical Analysis and ODEs · Mathematics 2016-09-06 Bille C. Carlson , John L. Gustafson

In this paper, we study quasi-twisted codes and their relationship with additive constacyclic codes through a polynomial-based approach. We first present a polynomial characterization of quasi-twisted codes over finite fields analogous to…

Information Theory · Computer Science 2026-03-09 Kanat Abdukhalikov , Gyanendra K. Verma