Packing and Covering Properties of Subspace Codes for Error Control in Random Linear Network Coding

DOI10.1109/TIT.2010.2043780zbMath1366.94679arXiv0811.4163OpenAlexW2155398259MaRDI QIDQ5281481

Zhiyuan Yan, Maximilien Gadouleau

Publication date: 27 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0811.4163

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items (7)

Construction of optimal constant-dimension subspace codes ⋮ Bounds on subspace codes based on totally isotropic subspaces in unitary spaces ⋮ Subspace code based on flats in affine space over finite fields ⋮ Bounds on subspace codes based on subspaces of type \((s,0,0,0)\) in pseudo-symplectic spaces and singular pseudo-symplectic spaces ⋮ Bounds on subspace codes based on totally isotropic subspace in symplectic spaces and extended symplectic spaces ⋮ Bounds on Subspace Codes Based on Orthogonal Space Over Finite Fields of Characteristic 2 ⋮ Bounds on subspace codes based on subspaces of type \((m, 1)\) in singular linear space

This page was built for publication: Packing and Covering Properties of Subspace Codes for Error Control in Random Linear Network Coding