The Asymptotic Behavior of Grassmannian Codes

DOI10.1109/TIT.2012.2207370zbMath1364.94689arXiv1111.2713MaRDI QIDQ2989750

Tuvi Etzion, Simon R. Blackburn

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1111.2713

Mathematics Subject Classification ID

Applications of graph theory (05C90) Hypergraphs (05C65) Bounds on codes (94B65) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Applications to coding theory and cryptography of arithmetic geometry (14G50) Combinatorial codes (94B25)

Related Items (3)

Subspace packings: constructions and bounds ⋮ Galois geometries and coding theory ⋮ Covering of subspaces by subspaces

This page was built for publication: The Asymptotic Behavior of Grassmannian Codes