2024/01/19 by Kurz, Sascha
#004 #510 #Galois geometry #constant dimension codes #partial spreads #subspace codes
paper · doi:10.15495/epub_ubt_00007398
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.