LCPs of Subspace Codes
By: Sanjit Bhowmick
Potential Business Impact:
Helps fix computer errors by pairing code groups.
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 dimensions equals the dimension of the ambient space. Equivalently, the two codes form an LCP if the direct sum of these two codes is equal to the entire space. In this paper, we introduce the concept of LCPs of subspace codes. We first provide a characterization of subspace codes that form an LCP. Furthermore, we present a sufficient condition for the existence of an LCP of subspace codes based on a complement function on a subspace code. In addition, we give several constructions of LCPs for subspace codes using various techniques and provide an application to insertion error correction.
Similar Papers
Pseudocodewords of quantum, quasi-cyclic, and spatially-coupled LDPC codes: a fundamental cone perspective
Information Theory
Finds hidden errors in digital messages.
From Random to Explicit via Subspace Designs With Applications to Local Properties and Matroids
Information Theory
Makes computer codes work better for tricky problems.
Asymptotically optimal cyclic subspace codes
Information Theory
Fixes errors in computer messages sent over networks.