Constructions and bounds for subspace codes
Information Theory
2025-12-23 v3 Combinatorics
math.IT
Abstract
Subspace codes are the -analog of binary block codes in the Hamming metric. Here the codewords are vector spaces over a finite field. They have e.g. applications in random linear network coding, distributed storage, and cryptography. In this chapter we survey known constructions and upper bounds for subspace codes.
Cite
@article{arxiv.2112.11766,
title = {Constructions and bounds for subspace codes},
author = {Sascha Kurz},
journal= {arXiv preprint arXiv:2112.11766},
year = {2025}
}
Comments
111 pages; typos corrected, remarks added, and references updated; comments more than welcome