Constructions and bounds for subspace codes
arXiv:2112.11766
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.
111 pages; typos corrected, remarks added, and references updated; comments more than welcome