English
Related papers

Related papers: New MDS Euclidean Self-orthogonal Codes

200 papers

Binary self-dual codes with large minimum distances, such as the extended Hamming code and the Golay code, are fascinating objects in the coding theory. They are closely related to sporadic simple groups, lattices and invariant theory. A…

Information Theory · Computer Science 2023-06-27 Hao Chen

We continue the study of classical and quantum low-density parity check (LDPC) codes from a physical perspective. We focus on constructive approaches and formulate a general framework for systematically constructing codes with various…

Quantum Physics · Physics 2024-02-27 Tibor Rakovszky , Vedika Khemani

Symbol-pair codes are proposed to guard against pair-errors in symbol-pair read channels. The minimum symbol-pair distance plays a vital role in determining the error-correcting capability and the constructions of symbol-pair codes with…

Information Theory · Computer Science 2022-06-22 Junru Ma , Jinquan Luo

Quadratic residue codes have been one of the most important classes of algebraic codes. They have been generalized into duadic codes and quadratic double circulant codes. In this paper we introduce a new subclass of double circulant codes,…

Information Theory · Computer Science 2012-02-07 Sunghyu Han , Jon-Lark Kim

Due to some practical applications, linear complementary dual (LCD) codes and self-orthogonal codes have attracted wide attention in recent years. In this paper, we use simplicial complexes for construction of an infinite family of binary…

Information Theory · Computer Science 2020-03-18 Yansheng Wu , Yoonjin Lee

Algebraic methods for the design of series of maximum distance separable (MDS) linear block and convolutional codes to required specifications and types are presented. Algorithms are given to design codes to required rate and required…

Information Theory · Computer Science 2022-07-14 Ted Hurley

Nine new 2-D OOCs are presented here, all sharing the common feature of a code size that is much larger in relation to the number of time slots than those of constructions appearing previously in the literature. Each of these constructions…

Information Theory · Computer Science 2009-11-03 Reza Omrani , Gagan Garg , P. Vijay Kumar , Petros Elia , Pankaj Bhambhani

The hull of linear codes plays an important role in quantum information and coding theory. In the present paper, by investigating the Galois hulls of generalized Reed-Solomon (GRS) codes and extended GRS codes over the finite field Fq, we…

Information Theory · Computer Science 2020-04-07 Meng Cao

In this paper, we propose a sufficient condition for a family of 2-generator self-orthogonal quasi-cyclic codes with respect to Hermitian inner product. Supported in the Hermitian construction, we show algebraic constructions of good…

Information Theory · Computer Science 2025-11-25 Liangdong Lu , Gaochi Zhang , Ganyu Feng , Wenzheng Ma

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

Let $p$ be an odd prime and $r,s,m$ be positive integers. In this study, we initiate our exploration by delving into the intricate structure of all repeated-root cyclic codes and their duals with a length of $2^rp^s$ over the finite field…

Information Theory · Computer Science 2024-06-21 Lanqiang Li , Ziwen Cao , Tingting Wu , Li Liu

Reed--Solomon codes are a well--studied code class which fulfill the Singleton bound with equality. However, their length is limited to the size $q$ of the underlying field $\mathbb{F}_q$. In this paper we present a code construction which…

Information Theory · Computer Science 2017-06-20 Michael Schelling , Martin Bossert

In this paper, we prove existence of optimal complementary dual codes (LCD codes) over large finite fields. We also give methods to generate orthogonal matrices over finite fields and then apply them to construct LCD codes. Construction…

Information Theory · Computer Science 2017-04-14 Lin Sok , Minjia Shi , Patrick Solé

Several kinds of q-orthogonal polynomials with |q|=1 are constructed as the main parts of the eigenfunctions of new solvable discrete quantum mechanical systems. Their orthogonality weight functions consist of quantum dilogarithm functions,…

Mathematical Physics · Physics 2016-01-22 Satoru Odake , Ryu Sasaki

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

It is always interesting and important to construct non-Reed-Solomon type MDS codes in coding theory and finite geometries. In this paper, we prove that there are non-Reed-Solomon type MDS codes from arbitrary genus algebraic curves. It is…

Information Theory · Computer Science 2023-07-27 Hao Chen

A linear code with parameters $[n,k,n-k]$ is said to be almost maximum distance separable (AMDS for short). An AMDS code whose dual is also AMDS is referred to as an near maximum distance separable (NMDS for short) code. NMDS codes have…

Information Theory · Computer Science 2022-04-26 Xiaoru Li , Ziling Heng

In order to construct quantum $[[n,0,d]]$ codes for $(n,d)=(56,15)$, $(57,15)$, $(58,16)$, $(63,16)$, $(67,17)$, $(70,18)$, $(71,18)$, $(79,19)$, $(83,20)$, $(87,20)$, $(89,21)$, $(95,20)$, we construct self-dual additive…

Combinatorics · Mathematics 2016-11-16 Markus Grassl , Masaaki Harada

We use multidimensional circulant approach to construct new qutrit stabilizer $\dsb{\ell, 0, d}$ codes with parameters $(\ell, d) \in \{(51, 16), (52, 16), (54, 17), (55, 17), (57, 17)\}$ through symplectic self-dual additive codes over…

Information Theory · Computer Science 2023-12-21 Padmapani Seneviratne , Hannah Cuff , Alexandra Koletsos , Kerry Seekamp , Adrian Thananopavarn

In this paper, we construct self-dual codes from a construction that involves 2x2 block circulant matrices, group rings and a reverse circulant matrix. We provide conditions whereby this construction can yield self-dual codes. We construct…

Rings and Algebras · Mathematics 2020-02-25 Joe Gildea , Abidin Kaya , Rhian Taylor , Alexander Tylyshchak