English
Related papers

Related papers: Combining subspace codes

200 papers

Quantum maximal-distance-separable (MDS) codes form an important class of quantum codes. To get $q$-ary quantum MDS codes, it suffices to find linear MDS codes $C$ over $\mathbb{F}_{q^2}$ satisfying $C^{\perp_H}\subseteq C$ by the Hermitian…

Information Theory · Computer Science 2014-03-12 Bocong Chen , San Ling , Guanghui Zhang

Given $\mathbb{F}_q$ the finite field with $q$ elements and an integer $n\geq 2$, a flag is a sequence of nested subspaces of $\mathbb{F}_q^n$ and a flag code is a nonempty set of flags. In this context, the distance between flags is the…

Information Theory · Computer Science 2021-11-11 Clementa Alonso-González , Miguel Ángel Navarro-Pérez , Xaro Soler-Escrivà

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

The Pl\"{u}cker coordinate description of subspaces has been recently discussed in the context of constant dimension subspace codes for random networks, as well as the Schubert cell description of certain code parameters. In this paper this…

Information Theory · Computer Science 2013-01-30 Anirban Ghatak

In this note, we apply some techniques developed in [1]-[3] to give a particular construction of bivariate Abelian Codes from cyclic codes, multiplying their dimension and preserving their apparent distance. We show that, in the case of…

Information Theory · Computer Science 2024-02-08 José Joaquín Bernal , Diana H. Bueno-Carreño , Juan Jacobo Simón

After a seminal paper by Shekeey (2016), a connection between maximum $h$-scattered $\mathbb{F}_q$-subspaces of $V(r,q^n)$ and maximum rank distance (MRD) codes has been established in the extremal cases $h=1$ and $h=r-1$. In this paper, we…

Combinatorics · Mathematics 2020-07-10 Giovanni Zini , Ferdinando Zullo

The projective space of order $n$ over a finite field $\F_q$ is a set of all subspaces of the vector space $\F_q^{n}$. In this work, we consider error-correcting codes in the projective space, focusing mainly on constant dimension codes. We…

Information Theory · Computer Science 2011-09-09 Natalia Silberstein

We propose a new family of spatially coupled product codes, called sub-block rearranged staircase (SR-staircase) codes. Each code block of SR-staircase codes is obtained by encoding rearranged preceding code blocks and new information…

Information Theory · Computer Science 2022-06-29 Min Qiu , Jinhong Yuan

This correspondence introduces two new constructive techniques to complete the determination of the sizes of optimal q-ary codes of constant weight three and distance four.

Information Theory · Computer Science 2008-03-27 Yeow Meng Chee , Son Hoang Dau , Alan C. H. Ling , San Ling

Constant dimension codes are used for error control in random linear network coding, so that constructions for these codes with large cardinality have achieved wide attention in the last decade. Here, we improve the so-called linkage…

Combinatorics · Mathematics 2020-05-06 Sascha Kurz

Errors are inevitable during all kinds quantum informational tasks and quantum error-correcting codes (QECCs) are powerful tools to fight various quantum noises. For standard QECCs physical systems have the same number of energy levels.…

Quantum Physics · Physics 2015-06-05 Zhuo Wang , Sixia Yu , Heng Fan , C. H. Oh

The Grassmannian ${\mathcal G}_q(n,k)$ is the set of all $k$-dimensional subspaces of the vector space $\mathbb{F}_q^n$. It is well known that codes in the Grassmannian space can be used for error-correction in random network coding. On the…

Information Theory · Computer Science 2019-03-04 Tuvi Etzion , Sascha Kurz , Kamil Otal , Ferruh Özbudak

Subspace codes were introduced in order to correct errors and erasures for randomized network coding, in the case where network topology is unknown (the noncoherent case). Subspace codes are indeed collections of subspaces of a certain…

Information Theory · Computer Science 2012-02-03 Hessam Mahdavifar , Alexander Vardy

Frameproof codes are used to fingerprint digital data. It can prevent copyrighted materials from unauthorized use. In this paper, we study upper and lower bounds for $w$-frameproof codes of length $N$ over an alphabet of size $q$. The upper…

Information Theory · Computer Science 2014-11-24 Chong Shangguan , Xin Wang , Gennian Ge , Ying Miao

In this paper, we analyze $m$-dimensional ($m$D) convolutional codes with finite support, viewed as a natural generalization of one-dimensional (1D) convolutional codes to higher dimensions. An $m$D convolutional code with finite support…

Information Theory · Computer Science 2026-03-26 Z. Abreu , J. Lieb , R. Pinto , R. Simoes

In this paper, we generalize the well-known index coding problem to exploit the structure in the source-data to improve system throughput. In many applications, the data to be transmitted may lie (or can be well approximated) in a…

Information Theory · Computer Science 2017-04-11 Bhavya Kailkhura , Lakshmi Narasimhan Theagarajan , Pramod K. Varshney

One hurdle to performing reliable quantum computations is overcoming noise. One possibility is to reduce the number of particles needing to be protected from noise and instead use systems with more states, so called qudit quantum computers.…

Quantum Physics · Physics 2022-04-27 Lane G. Gunderman

A $t$-$(n,d,\lambda)$ design over ${\mathbb F}_q$, or a subspace design, is a collection of $d$-dimensional subspaces of ${\mathbb F}_q^n$, called blocks, with the property that every $t$-dimensional subspace of ${\mathbb F}_q^n$ is…

Combinatorics · Mathematics 2019-03-18 Eimear Byrne , Alberto Ravagnani

Separable codes were introduced to provide protection against illegal redistribution of copyrighted multimedia material. Let $\mathcal{C}$ be a code of length $n$ over an alphabet of $q$ letters. The descendant code ${\sf…

Information Theory · Computer Science 2015-07-06 Minquan Cheng , Jing Jiang , Haiyan Li , Ying Miao , Xiaohu Tang

In this paper motivated from subspace coding we introduce subspace-metric codes and subset-metric codes. These are coordinate-position independent pseudometrics and suitable for the folded codes. The half-Singleton upper bounds for linear…

Information Theory · Computer Science 2021-10-20 Hao Chen