English
Related papers

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

200 papers

The hull of linear codes have promising utilization in coding theory and quantum coding theory. In this paper, we study the hull of generalized Reed-Solomon codes and extended generalized Reed-Solomon codes over finite fields with respect…

Information Theory · Computer Science 2018-07-13 Gaojun Luo , Xiwang Cao

The hull $H(C)$ of a linear code $C$ is defined by $H(C)=C \cap C^\perp$. A linear code with a complementary dual (LCD) is a linear code with $H(C)=\{0\}$. The dimension of the hull of a code is an invariant under permutation equivalence.…

Information Theory · Computer Science 2018-09-17 Ruud Pellikaan

In this paper, we study the dimension of cohomology of semipositive line bundles over Hermitian manifolds, and obtain an asymptotic estimate for the dimension of the space of harmonic $(0,q)$-forms with values in high tensor powers of a…

Complex Variables · Mathematics 2022-08-17 Huan Wang

A collection of sets satisfies a $(\delta,\varepsilon)$-proximity gap with respect to some property if for every set in the collection, either (i) all members of the set are $\delta$-close to the property in (relative) Hamming distance, or…

Information Theory · Computer Science 2026-01-16 Fernando Granha Jeronimo , Lenny Liu , Pranav Rajpal

In this article, we provide a comprehensive analysis of the asymptotic behavior of Bell numbers, enhancing and unifying various results previously dispersed in the literature. We establish several explicit lower and upper bounds. The main…

Number Theory · Mathematics 2024-08-27 Jerzy Grunwald , Grzegorz Serafin

We study asymptotic estimates of the dimension of cohomology on possibly non-compact complex manifolds for line bundles endowed with Hermitian metrics with algebraic singularities. We give a unified approach to establishing singular…

Complex Variables · Mathematics 2023-11-28 Dan Coman , George Marinescu , Huan Wang

We revisit and extend the connections between $\mathbb{F}_{q^m}$-linear rank-metric codes and evasive $\mathbb{F}_q$-subspaces of $\mathbb{F}_{q^m}^k$. We give a unifying framework in which we prove in an elementary way how the parameters…

Combinatorics · Mathematics 2022-04-26 Giuseppe Marino , Alessandro Neri , Rocco Trombetti

It was shown by Massey that linear complementary dual (LCD for short) codes are asymptotically good. In 2004, Sendrier proved that LCD codes meet the asymptotic Gilbert-Varshamov (GV for short) bound. Until now, the GV bound still remains…

Information Theory · Computer Science 2017-03-07 Lingfei Jin , Chaoping Xing

Let $X=X(n,q)$ be the set of $n\times n$ Hermitian matrices over $\mathbb{F}_{q^2}$. It is well known that $X$ gives rise to a metric translation association scheme whose classes are induced by the rank metric. We study $d$-codes in this…

Combinatorics · Mathematics 2017-08-18 Kai-Uwe Schmidt

In this work, we study and determine the dimensions of Euclidean and Hermitian hulls of two classical propagation rules, namely, the direct sum construction and the $(\mathbf{u},\mathbf{u+v})$-construction. Some new criteria for the…

Information Theory · Computer Science 2022-12-20 Yang Li , Shixin Zhu , Edgar Martínez-Moro

We study asymptotic lower and upper bounds for the sizes of constant dimension codes with respect to the subspace or injection distance, which is used in random linear network coding. In this context we review known upper bounds and show…

Combinatorics · Mathematics 2017-12-06 Daniel Heinlein , Sascha Kurz

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

We investigate the asymptotic rates of length-$n$ binary codes with VC-dimension at most $dn$ and minimum distance at least $\delta n$. Two upper bounds are obtained, one as a simple corollary of a result by Haussler and the other via a…

Information Theory · Computer Science 2018-08-31 Sihuang Hu , Nir Weinberger , Ofer Shayevitz

The set of all error-correcting codes C over a fixed finite alphabet F of cardinality q determines the set of code points in the unit square with coordinates (R(C), delta (C)):= (relative transmission rate, relative minimal distance). The…

Information Theory · Computer Science 2019-09-04 Yuri I. Manin , Matilde Marcolli

Linear complementary dual (LCD) codes are linear codes which intersect their dual codes trivially, which have been of interest and extensively studied due to their practical applications in computational complexity and information…

Information Theory · Computer Science 2023-02-14 Shitao Li , Minjia Shi , Huizhou Liu

This paper is concerned with investigating the asymptotic behavior of the gradients of solutions to a class of elliptic systems with general boundary data, especially covering the Lam\'{e} systems, in a narrow region. The novelty of this…

Analysis of PDEs · Mathematics 2022-04-15 Zhiwen Zhao

In their seminal 1989 work (IEEE Trans. Inf. Theory 35(3):655-657), Roth and Lempel constructed a well-known family of non-Reed-Solomon maximum distance separable (MDS) codes. For decades, this family of codes has attracted extensive…

Information Theory · Computer Science 2026-04-28 Qi Liu , Xuefei Wu , Yingchun Cheng , Haiyan Zhou

We prove that all hierarchically hyperbolic spaces have finite asymptotic dimension and obtain strong bounds on these dimensions. One application of this result is to obtain the sharpest known bound on the asymptotic dimension of the…

Group Theory · Mathematics 2017-05-04 Jason Behrstock , Mark F. Hagen , Alessandro Sisto

We derive an asymptotic formula which counts the number of abelian extensions of prime degrees over rational function fields. Specifically, let $\ell$ be a rational prime and $K$ a rational function field $\Bbb F_q(t)$ with $\ell \nmid q$.…

Number Theory · Mathematics 2015-09-07 Chih-Yun Chuang , Yen-Liang Kuan

MDS codes have diverse practical applications in communication systems, data storage, and quantum codes due to their algebraic properties and optimal error-correcting capability. In this paper, we focus on a class of linear codes and…

Information Theory · Computer Science 2024-01-09 Yansheng Wu , Ziling Heng , Chengju Li , Cunsheng Ding
‹ Prev 1 4 5 6 7 8 10 Next ›