Subspace codes are the $q$-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.

翻译：子空间码是在汉明度量下二进制分组码的q-模拟。在此编码中，码字是有限域上的向量空间。它们可应用于随机线性网络编码、分布式存储和密码学等领域。本章综述了子空间码的已知构造方法和上界。