30 citations · 51 across the 4 of their papers we have counts for
Showing 2005Show all
2 papers · 1 filter
cs.IT2005★ 15 cited
A bound on Grassmannian codes
Alexander Barg, Dmitry Nogin
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 ex…
cs.IT2005★ 6 cited
Spectral approach to linear programming bounds on codes
Alexander Barg, Dmitry Nogin
We give new proofs of asymptotic upper bounds of coding theory obtained within the frame of Delsarte's linear programming method. The proofs rely on the analysis of eigenvectors of…