English
Related papers

Related papers: A further study on the mass formula for linear cod…

200 papers

The quantum-field model described by non-Hermitian, but a ${\cal PT}$-symmetric Hamiltonian is considered. It is shown by the algebraic way that the limiting of the physical mass value $m \leq m_{max}= {m_1}^2/2m_2$ takes place for the case…

Mathematical Physics · Physics 2012-07-24 V. N. Rodionov

Maximum Distance Separable (MDS) self-dual codes are of significant theoretical and practical importance. Generalized Reed-Solomon (GRS) codes are the most prominent MDS codes. Correspondingly there have been many research on constructions…

Information Theory · Computer Science 2026-02-09 Chun'e Zhao , Wenping Ma

Hulls of linear codes have been of interest and extensively studied due to their rich algebraic structures and wide applications. In this paper, alternative characterizations of hulls of linear codes are given as well as their applications.…

Information Theory · Computer Science 2019-09-11 Satanan Thipworawimon , Somphong Jitman

Let $\mathbb{F}_q$ be a finite field of $q$ elements, for some prime power $q$, and let $G$ be a finite group. A (left) group code, or simply a $G$-code, is a (left) ideal of the group algebra $\mathbb{F}_q[G]$. In this paper, we provide a…

Information Theory · Computer Science 2026-02-05 Miguel Sales-Cabrera , Xaro Soler-Escrivà , Víctor Sotomayor

Discrete circular convolution over $\mathbb{Z}/N\mathbb{Z}$ is a linear operator and can be implemented on quantum hardware within the linear-combination-of-unitaries (LCU) framework. In this work, we make this connection explicit through…

Quantum Physics · Physics 2026-03-17 Chen Yang , Kodai Kanemaru , Norio Yoshida , Sergey Gusarov , Hiroshi C. Watanabe

We develop a framework for obtaining linear programming bounds for spherical codes whose inner products belong to a prescribed subinterval $[\ell,s]$ of $[-1,1)$. An intricate relationship between Levenshtein-type upper bounds on…

Metric Geometry · Mathematics 2018-01-24 P. G. Boyvalenkov , P. D. Dragnev , D. P. Hardin , E. B. Saff , M. M. Stoyanova

We present a systematic perturbative construction of the most general metric operator (and positive-definite inner product) for quasi-Hermitian Hamiltonians of the standard form, H= p^2/2 + v(x), in one dimension. We show that this problem…

Quantum Physics · Physics 2009-11-11 Ali Mostafazadeh

We show that the weight enumerator of any binary linear code is equal to the permanent of a 3-dimensional hypermatrix (3-matrix). We also show that each permanent is a determinant of a 3-matrix. As an application we write the dimer…

Combinatorics · Mathematics 2016-09-28 Martin Loebl , Pavel Rytíř

For a linear code $C$ over a finite field, if its dual code $C^{\perp}$ is equivalent to itself, then the code $C$ is said to be {\it isometry-dual}. In this paper, we first confirm a conjecture about the isometry-dual MDS elliptic codes…

Information Theory · Computer Science 2025-02-05 Yunlong Zhu , Chang-An Zhao

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

In this paper we study the algebraic-geometry of any one-point code on the Hermitian curve. Moreover, we characterize the minimum-weight codewords of some of their dual codes and describe many their small-weight codewords.

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

We study entanglement-assisted quantum error-correcting codes (EAQECCs) arising from classical one-point algebraic geometry codes from the Hermitian curve with respect to the Hermitian inner product. Their only unknown parameter is $c$, the…

Information Theory · Computer Science 2022-01-12 René Bødker Christensen , Carlos Munuera , Francisco Revson F. Pereira , Diego Ruano

In this paper, we consider the Reed-Muller (RM) codes. For the first order RM code, we prove that it is unique in the sense that any linear code with the same length, dimension and minimum distance must be the first order RM code; For the…

Information Theory · Computer Science 2009-04-30 Yanling Chen , Han Vinck

We present a general construction of asymmetric quantum codes based on additive codes under the trace Hermitian inner product. Various families of additive codes over $\F_{4}$ are used in the construction of many asymmetric quantum codes…

Information Theory · Computer Science 2013-07-04 Martianus Frederic Ezerman , San Ling , Patrick Sole

Linear complementary dual codes (LCD) are linear codes satisfying $C\cap C^{\perp}=\{0\}$. Under suitable conditions, matrix-product codes that are complementary dual codes are characterized. We construct LCD codes using quasi-orthogonal…

Information Theory · Computer Science 2016-04-14 Xiusheng Liu , Hualu Liu

An iterative scheme is set up for solving the loop equation of the hermitian one-matrix model with a multi-cut structure. Explicit results are presented for genus one for an arbitrary but finite number of cuts. Due to the complicated form…

High Energy Physics - Theory · Physics 2009-10-30 G. Akemann

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

In previous works it was shown that protein 3D-conformations could be encoded into discrete sequences called dominance partition sequences (DPS), that generated a linear partition of molecular conformational space into regions of molecular…

Computational Physics · Physics 2009-12-09 Jacques Gabarro-Arpa

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

Block codes, which correct asymmetric errors with limited-magnitude, are studied. These codes have been applied recently for error correction in flash memories. The codes will be represented by lattices and the constructions will be based…

Information Theory · Computer Science 2011-12-13 Sarit Buzaglo , Tuvi Etzion