English
Related papers

Related papers: Subspace Polynomials and Cyclic Subspace Codes

200 papers

Cyclic codes have efficient encoding and decoding algorithms over finite fields, so that they have practical applications in communication systems, consumer electronics and data storage systems. The objective of this paper is to give eight…

Information Theory · Computer Science 2022-05-02 Lanqiang Li , Li Liu , Shixin Zhu

In this paper we construct, using GAP System for Computational Discrete Algebra, some cyclic subspace codes, specially an optimal code over the finite field F_{2^{10}}. Further we present a definition and an example of the $q$-analogous of…

Combinatorics · Mathematics 2016-08-03 Ismael Gutierrez , Ivan Molina

We consider linear cyclic codes with the locality property, or locally recoverable codes (LRC codes). A family of LRC codes that generalizes the classical construction of Reed-Solomon codes was constructed in a recent paper by I. Tamo and…

Information Theory · Computer Science 2015-02-06 Itzhak Tamo , Alexander Barg , Sreechakra Goparaju , Robert Calderbank

In network coding, a flag code is a set of sequences of nested subspaces of $\mathbb{F}_q^n$, being $\mathbb{F}_q$ the finite field with $q$ elements. Flag codes defined as orbits of a cyclic subgroup of the general linear group acting on…

Information Theory · Computer Science 2021-02-02 Clementa Alonso-González , Miguel Ángel Navarro-Pérez

In an interesting paper Professor Cunsheng Ding provided three constructions of cyclic codes of length being a product of two primes. Numerical data shows that many codes from these constructions are best cyclic codes of the same length and…

Information Theory · Computer Science 2017-04-03 Maosheng Xiong

Cyclic orbit codes are a family of constant dimension codes used for random network coding. We investigate the Pl\"ucker embedding of these codes and show how to efficiently compute the Grassmann coordinates of the code words.

Information Theory · Computer Science 2012-05-10 Anna-Lena Trautmann

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

Quantum computers theoretically are able to solve certain problems more quickly than any deterministic or probabilistic computers. A quantum computer exploits the rules of quantum mechanics to speed up computations. However, one has to…

Information Theory · Computer Science 2010-02-17 Salah A. Aly , Alexei Ashikhmin

We introduce a class of cyclic quantum codes, basing the construction not on the simplicity of the stabilizers, but rather on the simplicity of preparation of a code state (at least in the absence of noise). We show how certain known codes,…

Quantum Physics · Physics 2025-10-21 Matthew B. Hastings

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. In this paper, a class of three-weight…

Information Theory · Computer Science 2013-02-05 Zhengchun Zhou , Cunsheng Ding

A subspace code is a nonempty collection of subspaces of the vector space $\mathbb{F}_q^{n}$. A pair of linear codes is called a linear complementary pair (in short LCP) of codes if their intersection is trivial and the sum of their…

Information Theory · Computer Science 2026-04-03 Sanjit Bhowmick

A subspace of a finite extension field is called a Sidon space if the product of any two of its elements is unique up to a scalar multiplier from the base field. Sidon spaces were recently introduced by Bachoc et al. as a means to…

Information Theory · Computer Science 2017-05-19 Ron M. Roth , Netanel Raviv , Itzhak Tamo

We completely characterize possible indices of quasi-cyclic subcodes in a cyclic code for a very broad class of cyclic codes. We present enumeration results for quasi-cyclic subcodes of a fixed index and show that the problem of enumeration…

Information Theory · Computer Science 2016-03-17 Jean-Claude Belfiore , Cem Güneri , Buket Özkaya

We consider linear cyclic codes with the locality property, or locally recoverable codes (LRC codes). A family of LRC codes that generalize the classical construction of Reed-Solomon codes was constructed in a recent paper by I. Tamo and A.…

Information Theory · Computer Science 2017-02-10 Itzhak Tamo , Alexander Barg , Sreechakra Goparaju , Robert Calderbank

Cyclic codes, as a crucial subclass of linear codes, exhibit broad applications in communication systems, data storage systems, and consumer electronics, primarily attributed to their well-structured algebraic properties. Let $p$ denote an…

Information Theory · Computer Science 2025-09-15 Mengen Fang , Lanqiang Li , Fuyin Tian , Li Liu

Quantum synchronizable codes are quantum error-correcting codes designed to correct the effects of both quantum noise and block synchronization errors. While it is known that quantum synchronizable codes can be constructed from cyclic codes…

Information Theory · Computer Science 2014-08-19 Yixuan Xie , Jinhong Yuan , Yuichiro Fujiwara

Cyclic subspace codes gained a lot of attention especially because they may be used in random network coding for correction of errors and erasures. Roth, Raviv and Tamo in 2018 established a connection between cyclic subspace codes (with…

Combinatorics · Mathematics 2022-12-29 Ferdinando Zullo

Cyclic codes have many applications in consumer electronics, communication and data storage systems due to their efficient encoding and decoding algorithms. An efficient approach to constructing cyclic codes is the sequence approach. In…

Information Theory · Computer Science 2022-10-24 Sihem Mesnager , Minjia Shi , Hongwei Zhu

It is recently conjectured in quantum information processing that phase-shift errors occur with high probability than qubit-flip errors, hence the former is more disturbing to quantum information than the later one. This leads us to…

Information Theory · Computer Science 2009-11-30 Salah A. Aly

We improve on the lower bound of the maximum number of planes of ${\rm PG}(8,q)$ mutually intersecting in at most one point leading to the following lower bound: ${\cal A}_q(9, 4; 3) \ge q^{12}+2q^8+2q^7+q^6+q^5+q^4+1$ for constant…

Combinatorics · Mathematics 2019-05-28 Antonio Cossidente , Giuseppe Marino , Francesco Pavese