English
Related papers

Related papers: How to Expand a Self-orthogonal Code

200 papers

We show that any ternary Euclidean (resp.\ quaternary Hermitian) linear complementary dual $[n,k]$ code contains a Euclidean (resp.\ Hermitian) linear complementary dual $[n,k-1]$ subcode for $2 \le k \le n$. As a consequence, we derive a…

Information Theory · Computer Science 2020-11-20 Masaaki Harada , Ken Saito

Given an n-dimensional natural Hamiltonian L on a Riemannian or pseudo-Riemannian manifold, we call "extension" of L the n+1 dimensional Hamiltonian $H=\frac 12 p_u^2+\alpha(u)L+\beta(u)$ with new canonically conjugated coordinates…

Exactly Solvable and Integrable Systems · Physics 2015-06-17 Giovanni Rastelli

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 technique of "extension" allows to build $(n+1)$-dimensional Hamiltonian systems with a non-trivial polynomial in the momenta first integral of any given degree starting from a $n$-dimensional Hamiltonian satisfying some additional…

Mathematical Physics · Physics 2015-06-17 Claudia M. Chanu , Luca Degiovanni , Giovanni Rastelli

We study the Hermitian hull-variation problem for vector rank-metric codes. Except for one parameter pair, we show that the Hermitian hull dimension of such a code can be reduced to any smaller value within its equivalence class, and in…

Information Theory · Computer Science 2026-05-20 Duy Ho

The purpose of this paper is to study the cyclic self orthogonal codes over $\mathbb{Z}_{p^m}$. After providing the generator polynomial of cyclic self orthogonal codes over $\mathbb{Z}_{p^m}$, we give the necessary and sufficient condition…

Information Theory · Computer Science 2015-07-14 Abhay Kumar Singh , Narendra Kumar

We show that every self-orthogonal code over $\mathbb F_q$ of length $n$ can be extended to a self-dual code, if there exists self-dual codes of length $n$. Using a family of Galois towers of algebraic function fields we show that over any…

Information Theory · Computer Science 2017-09-22 Alp Bassa , Henning Stichtenoth

In this paper, we propose a mechanism on the constructions of MDS codes with arbitrary dimensions of Euclidean hulls. Precisely, we construct (extended) generalized Reed-Solomon(GRS) codes with assigned dimensions of Euclidean hulls from…

Information Theory · Computer Science 2019-10-24 Xiaolei Fang , Meiqing Liu , Jinquan Luo

Self-orthogonal codes have received great attention due to their important applications in quantum codes, LCD codes and lattices. Recently, several families of self-orthogonal codes containing the all-$1$ vector were constructed by…

Information Theory · Computer Science 2025-08-06 Yadi Wei , Jiaxin Wang , Fang-Wei Fu

In this correspondence, first-tier indirect (direct) discernible constellation expansions are defined for generalized orthogonal designs. The expanded signal constellation, leading to so-called super-orthogonal codes, allows the achievement…

Information Theory · Computer Science 2011-09-06 Dumitru Mihai Ionescu , Zhiyuan Yan

The study of optical orthogonal codes has been motivated by an application in an optical code-division multiple access system. This paper focuses on optimal two-dimensional optical orthogonal codes with autocorrelation and cross-correlation…

Combinatorics · Mathematics 2026-02-24 Xiuling Shan , Lidong Wang , Yanxun Chang , Xiaomiao Wang

Let $\mathcal{R}_{e,m}$ be a finite commutative chain ring of even characteristic with maximal ideal $\langle u \rangle$ of nilpotency index $e \geq 2,$ Teichm$\ddot{u}$ller set $\mathcal{T}_{m},$ and residue field…

Information Theory · Computer Science 2026-01-16 Monika Yadav , Anuradha Sharma

Let $q=p^h$ be a prime power and $e$ be an integer with $0\leq e\leq h-1$. $e$-Galois self-orthogonal codes are generalizations of Euclidean self-orthogonal codes ($e=0$) and Hermitian self-orthogonal codes ($e=\frac{h}{2}$ and $h$ is…

Information Theory · Computer Science 2023-02-10 Yang Li , Yunfei Su , Shixin Zhu , Shitao Li , Minjia Shi

The intersection ${\bf C}\bigcap {\bf C}^{\perp_H}$ of a linear code ${\bf C} \subset {\bf F}_{q^2}$ and its Hermitian dual ${\bf C}^{\perp_H}$ is called the Hermitian hull of this code. A linear code ${\bf C} \subset {\bf F}_{q^2}$…

Information Theory · Computer Science 2022-09-27 Hao Chen

A harmonic oscillator Hamiltonian augmented by a non-Hermitian \pt-symmetric part and its su(1,1) generalizations, for which a family of positive-definite metric operators was recently constructed, are re-examined in a supersymmetric…

Mathematical Physics · Physics 2008-11-26 C. Quesne

We provide a construction for quantum codes (hermitian-self-orthogonal codes over GF(4)) starting from cyclic codes over GF(4^m). We also provide examples of these codes some of which meet the known bounds for quantum codes.

Quantum Physics · Physics 2007-05-23 Andrew Thangaraj , Steven McLaughlin

We consider the following fundamental question on $\epsilon$-differential privacy. Consider an arbitrary $\epsilon$-differentially private algorithm defined on a subset of the input space. Is it possible to extend it to an…

Statistics Theory · Mathematics 2018-11-01 Christian Borgs , Jennifer Chayes , Adam Smith , Ilias Zadik

In this paper, by calculating the dual code of the Schur square for the standard twisted Reed-Solomon code, we give a sufficient and necessary condition for the generalized twisted Reed-Solomon code with $h+t\le k-1$ to be self-orthogonal,…

Information Theory · Computer Science 2022-01-11 Canze Zhu , Qunying Liao

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

In 2011, Guruswami-H{\aa}stad-Kopparty \cite{Gru} showed that the list-decodability of random linear codes is as good as that of general random codes. In the present paper, we further strengthen the result by showing that the…

Information Theory · Computer Science 2016-11-22 Lingfei Jin , Chaoping Xing , Xiande Zhang