Constructions and bounds for subspace codes
Sascha Kurz
TL;DR
This paper surveys known constructions and upper bounds for subspace codes, which are vector space-based codes with applications in network coding, storage, and cryptography.
Contribution
It provides a comprehensive overview of existing methods and bounds for subspace codes, highlighting recent developments in the field.
Findings
Summarizes key constructions of subspace codes
Details upper bounds on code sizes
Highlights applications in network coding and cryptography
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCooperative Communication and Network Coding · Coding theory and cryptography · Advanced Wireless Communication Technologies