English
Related papers

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

200 papers

In this paper, we study the Hermitian hulls of generalized Reed-Solomon (GRS) codes over finite fields. For a given class of GRS codes, by extending the length, increasing the dimension, and extending the length and increasing the dimension…

Information Theory · Computer Science 2024-11-07 Ruhao Wan , Shixin Zhu

Duadic codes are a class of cyclic codes that generalizes quadratic residue codes from prime to composite lengths. For every prime power q, we characterize the integers n such that over the finite field with q^2 elements there is a duadic…

Combinatorics · Mathematics 2007-05-23 Lilibeth Dicuangco , Pieter Moree , Patrick Sole

Linear codes with small hulls over finite fields have been extensively studied due to their practical applications in computational complexity and information protection. In this paper, we develop a general method to determine the exact…

Information Theory · Computer Science 2022-11-29 Shitao Li , Minjia Shi , Huizhou Liu

We study the dual linear code of points and generators on a non-singular Hermitian variety $\mathcal{H}(2n+1,q^2)$. We improve the earlier results for $n=2$, we solve the minimum distance problem for general $n$, we classify the $n$…

Combinatorics · Mathematics 2016-01-05 Maarten De Boeck , Peter Vandendriessche

Asymptotics of solutions to fractional elliptic equations with Hardy type potentials is studied in this paper. By using an Almgren type monotonicity formula, separation of variables, and blow-up arguments, we describe the exact behavior…

Analysis of PDEs · Mathematics 2013-07-16 Mouhamed Moustapha Fall , Veronica Felli

In this paper, we construct MDS Euclidean self-dual codes which are extended cyclic duadic codes. And we obtain many new MDS Euclidean self-dual codes. We also construct MDS Hermitian self-dual codes from generalized Reed-Solomon codes and…

Information Theory · Computer Science 2016-06-24 Hongxi Tong , Xiaoqing Wang

We introduce quaternary modified four $\mu$-circulant codes as a modification of four circulant codes. We give basic properties of quaternary modified four $\mu$-circulant Hermitian self-dual codes. We also construct quaternary modified…

Information Theory · Computer Science 2024-01-30 Masaaki Harada

We study $q$-ary codes with distance defined by a partial order of the coordinates of the codewords. Maximum Distance Separable (MDS) codes in the poset metric have been studied in a number of earlier works. We consider codes that are close…

Information Theory · Computer Science 2010-05-03 Alexander Barg , Punarbasu Purkayastha

We construct MDS Euclidean and Hermitian self-dual codes over large finite fields of odd and even characteristics. Our codes arise from cyclic and negacyclic duadic codes.

Information Theory · Computer Science 2010-04-08 Kenza Guenda

The generalized Hamming weight of linear codes is a natural generalization of the minimum Hamming distance. They convey the structural information of a linear code and determine its performance in various applications, and have become one…

Information Theory · Computer Science 2022-12-08 Chao Liu , Dabin Zheng , Xiaoqiang Wang

Additive codes over GF(9) that are self-dual with respect to the Hermitian trace inner product have a natural application in quantum information theory, where they correspond to ternary quantum error-correcting codes. However, these codes…

Combinatorics · Mathematics 2012-07-24 Lars Eirik Danielsen

Both maximum distance separable (MDS) codes that are not equivalent to generalized Reed-Solomon (GRS) codes (non-GRS MDS codes) and near MDS (NMDS) codes have nice applications in communication and storage systems. In this paper, we…

Information Theory · Computer Science 2025-01-28 Yang Li , Zhonghua Sun , Shixin Zhu

We define the Euclidean hull of a linear code $C$ as the intersection of $C$ and its Euclidean dual $C^\perp$. The hull with low dimensions gets much interest due to its crucial role in determining the complexity of algorithms for computing…

Information Theory · Computer Science 2020-12-22 Lin Sok

We establish the existence of optimal maximal entanglement entanglement-assisted quantum $[[n,k,d;n-k]]_2$ codes for $(n,k,d)=(14,6,7)$, $(15,7,7)$, $(17,6,9)$, $(17,7,8)$, $(19,7,9)$ and $(20,7,10)$. These codes are obtained from…

Combinatorics · Mathematics 2020-11-20 Masaaki Harada

The intersection ${\bf C}\bigcap {\bf C}^{\perp}$ (${\bf C}\bigcap {\bf C}^{\perp_h}$) of a linear code ${\bf C}$ and its Euclidean dual ${\bf C}^{\perp}$ (Hermitian dual ${\bf C}^{\perp_h}$) is called the Euclidean (Hermitian) hull of this…

Information Theory · Computer Science 2022-11-29 Hao Chen

We study the algebraic geometry of a family of evaluation codes from plane smooth curves defined over any field. In particular, we provide a cohomological characterization of their dual minimum distance. After having discussed some general…

Algebraic Geometry · Mathematics 2013-12-13 Edoardo Ballico , Alberto Ravagnani

We study Hermitian random matrix models with an external source matrix which has equispaced eigenvalues, and with an external field such that the limiting mean density of eigenvalues is supported on a single interval as the dimension tends…

Mathematical Physics · Physics 2013-06-25 Tom Claeys , Dong Wang

We study the locally recoverable codes on algebraic curves. In the first part of this article, we provide a bound of generalized Hamming weight of these codes. Whereas in the second part, we propose a new family of algebraic geometric LRC…

Commutative Algebra · Mathematics 2016-05-25 Edoardo Ballico , Chiara Marcolla

Modern density functional approximations achieve moderate accuracy at low computational cost for many electronic structure calculations. Some background is given relating the gradient expansion of density functional theory to the WKB…

Chemical Physics · Physics 2021-01-27 Kieron Burke

In this paper we study a semilinear elliptic problem on a bounded domain in $\R^2$ with large exponent in the nonlinear term. We consider positive solutions obtained by minimizing suitable functionals. We prove some asymtotic estimates…

Analysis of PDEs · Mathematics 2007-05-23 Khalil El Mehdi , Massimo Grossi