English
Related papers

Related papers: New Binary and Ternary Quasi-Cyclic Codes with Goo…

200 papers

We focus on two aspects of cyclic orbit codes: invariants under equivalence and quasi-optimality. Regarding the first aspect, we establish a connection between the codewords of a cyclic orbit code and a certain linear set on the projective…

Information Theory · Computer Science 2025-01-08 Chiara Castello , Heide Gluesing-Luerssen , Olga Polverino , Ferdinando Zullo

In this work, our main objective is to construct quantum codes from quasi-twisted (QT) codes. At first, a necessary and sufficient condition for Hermitian self-orthogonality of QT codes is introduced by virtue of the Chinese Remainder…

Information Theory · Computer Science 2020-01-07 Jingjie Lv , Ruihu Li , Junli Wang

In coding theory, constructing codes with good parameters is one of the most important and fundamental problems. Though a great many of good codes have been produced, most of them are defined over alphabets of sizes equal to prime powers.…

Information Theory · Computer Science 2022-09-01 Shu Liu , Liming Ma , Ting-Yi Wu , Chaoping Xing

We prove a new lower bound on the field size of locally repairable codes (LRCs). Additionally, we construct maximally recoverable (MR) codes which are cyclic. While a known construction for MR codes has the same parameters, it produces…

Information Theory · Computer Science 2022-08-23 Han Cai , Moshe Schwartz

We propose a new family of polar coding which realizes high coding gain, low complexity, and high throughput by introducing a protograph-based design. The proposed technique called as quasi-cyclic (QC) polar codes can be highly parallelized…

Information Theory · Computer Science 2021-02-26 Toshiaki Koike-Akino , Ye Wang

Quasi-polycyclic (QP for short) codes over a finite chain ring $R$ are a generalization of quasi-cyclic codes, and these codes can be viewed as an $R[x]$-submodule of $\mathcal{R}_m^{\ell}$, where $\mathcal{R}_m:= R[x]/\langle f\rangle$,…

Information Theory · Computer Science 2021-11-10 Rongsheng Wu , Minjia Shi , Patrick Solé

Quantum error correcting codes (QECC) is becoming an increasingly important branch of coding theory. For classical block codes, a \href{codetables.de} {comprehensive database of best known codes} exists which is available online at…

Information Theory · Computer Science 2021-08-21 Nuh Aydin , Peihan Liu , Bryan Yoshino

Construction of subspace codes with good parameters is one of the most important problems in random network coding. In this paper we present first a generalization of the concept of cyclic subspaces codes and further we show that the usual…

Information Theory · Computer Science 2016-08-11 Ismael Gutierrez Garcia , Ivan Molina Naizir

Multi-twisted (MT) codes were introduced as a generalization of quasi-twisted (QT) codes. QT codes have been known to contain many good codes. In this work, we show that codes with good parameters and desirable properties can be obtained…

Information Theory · Computer Science 2020-08-18 Nuh Aydin , Thomas Guidotti , Peihan Liu

Quantum synchronizable codes are kinds of quantum error-correcting codes that can not only correct the effects of quantum noise on qubits but also the misalignment in block synchronization. In this paper, the quantum synchronizable codes…

Cryptography and Security · Computer Science 2021-05-11 Tao Wang , Tongjiang Yan , Xueting Wang

We apply quantum Construction X on quasi-cyclic codes with large Hermitian hulls over $\mathbb{F}_4$ and $\mathbb{F}_9$ to derive good qubit and qutrit stabilizer codes, respectively. In several occasions we obtain quantum codes with…

Information Theory · Computer Science 2020-04-28 Martianus Frederic Ezerman , San Ling , Buket Özkaya , Patrick Solé

In this paper, a construction of a pair of "regular" quasi-cyclic LDPC codes as ingredient codes for a quantum error-correcting code is proposed. That is, we find quantum regular LDPC codes with various weight distributions. Furthermore our…

Quantum Physics · Physics 2016-11-18 Manabu Hagiwara , Hideki Imai

In this article, we construct infinite families of quaternary (that is, over the ring $\mathbb{Z}_4$) $\mathcal{C}_{D}$-codes, where the defining set $D$ is derived utilizing a two-generator simplicial complex, and determine their Lee…

Information Theory · Computer Science 2026-05-15 Ankit Yadav , Nilay Kumar Mondal , Ritumoni Sarma

Recently, simplicial complexes are used in constructions of several infinite families of minimal and optimal linear codes by Hyun {\em et al.} Building upon their research, in this paper more linear codes over the ring $\mathbb{Z}_4$ are…

Information Theory · Computer Science 2024-01-24 Yansheng Wu , Chao Li , Lin Zhang , Fu Xiao

Quasi-cyclic (QC) low-density parity-check (LDPC) codes which are known as QC-LDPC codes, have many applications due to their simple encoding implementation by means of cyclic shift registers. In this paper, we construct QC-LDPC codes from…

Information Theory · Computer Science 2017-01-03 Hassan Khodaiemehr , Dariush Kiani

A superimposed code is a collection of binary vectors (codewords) with the property that no vector is contained in the Boolean sum of any $k$ others, enabling unique identification of codewords within any group of $k$. Superimposed codes…

Data Structures and Algorithms · Computer Science 2025-08-05 Gianluca De Marco , Dariusz R. Kowalski

Quantum maximal-distance-separable (MDS) codes form an important class of quantum codes. It is very hard to construct quantum MDS codes with relatively large minimum distance. In this paper, based on classical constacyclic codes, we…

Information Theory · Computer Science 2014-05-22 Liqi Wang , Shixin Zhu

Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. Let $m=2\ell+1$ for an integer $\ell\geq 1$…

Information Theory · Computer Science 2015-10-20 Cuiling Fan , Nian Li , Zhengchun Zhou

Linear codes over finite fields parameterized by functions have proven to be a powerful tool in coding theory, yielding optimal and few-weight codes with significant applications in secret sharing, authentication codes, and association…

Information Theory · Computer Science 2026-02-17 Virginio Fratianni , Sihem Mesnager

One central theme in quantum error-correction is to construct quantum codes that have a large minimum distance. In this paper, we first present a construction of classical codes based on certain class of polynomials. Through these classical…

Information Theory · Computer Science 2015-08-06 Tao Zhang , Gennian Ge