A bound on Grassmannian codes
A bound on Grassmannian codes
We give a new asymptotic upper bound on the size of a code in the Grassmannian space. The bound is better than the upper bounds known previously in the entire range of distances except very large values.
5 pages, submitted
- University of Maryland, College Park United States
- University of Maryland United States
- Indian Institute of Technology Patna India
- University of Maryland United States
FOS: Computer and information sciences, Blichfeldt's method, Computer Science - Information Theory, Information Theory (cs.IT), Chordal distance, Applications to coding theory and cryptography of arithmetic geometry, Metric Geometry (math.MG), Grassmannians, Schubert varieties, flag manifolds, Theoretical Computer Science, Isometric embedding, Bounds on codes, Computational Theory and Mathematics, Mathematics - Metric Geometry, FOS: Mathematics, Discrete Mathematics and Combinatorics, Spherical cap, spherical cap, isometric embedding, Geometric methods (including applications of algebraic geometry) applied to coding theory
FOS: Computer and information sciences, Blichfeldt's method, Computer Science - Information Theory, Information Theory (cs.IT), Chordal distance, Applications to coding theory and cryptography of arithmetic geometry, Metric Geometry (math.MG), Grassmannians, Schubert varieties, flag manifolds, Theoretical Computer Science, Isometric embedding, Bounds on codes, Computational Theory and Mathematics, Mathematics - Metric Geometry, FOS: Mathematics, Discrete Mathematics and Combinatorics, Spherical cap, spherical cap, isometric embedding, Geometric methods (including applications of algebraic geometry) applied to coding theory
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).13 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!