Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Dmitry Yu. Nogin

dblp:18/2657 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2006
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 80% Computational geometry · 20%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › coding bounds › minimum distance bounds
gilbert-varshamov bound		 0.012002
Bounds on packings of spheres in the Grassmann manifold · IEEE Trans. Inf. Theory 2002
Computational geometry
grassmann manifold		 0.012002
Bounds on packings of spheres in the Grassmann manifold · IEEE Trans. Inf. Theory 2002
Coding theory
sphere packing		 0.012002
Bounds on packings of spheres in the Grassmann manifold · IEEE Trans. Inf. Theory 2002
Coding theory › error-correcting codes › coding bounds › packing bounds
sphere-packing bound		 0.012002
Bounds on packings of spheres in the Grassmann manifold · IEEE Trans. Inf. Theory 2002

Methods — techniques the papers use, named apart from their topics

packing bounds · 0.0asymptotic analysis · 0.0
YearPublicationVenuePosition
2006 A bound on Grassmannian codes
abstract
We derive a new upper bound on the size of a code in the Grassmannian space. The bound is asymptotically better than the upper bounds known previously in the entire range of distances except very large values
Alexander Barg, Dmitry Yu. Nogin
 ISIT2
2005 Correction to "Bounds on Packings of Spheres in the Grassmann Manifold"
abstract
In the above titled paper (ibid., vol. 48, no. 9, pp.2450-2454, Sep 02), corrections were made to Haar measurements in various equations.
Alexander Barg, Dmitry Yu. Nogin
 IEEE Trans. Inf. Theory2
2002 Bounds on packings of spheres in the Grassmann manifold
abstract
We derive the Gilbert-Varshamov and Hamming bounds for packings of spheres (codes) in the Grassmann manifolds over R and C. Asymptotic expressions are obtained for the geodesic metric and projection Frobenius (chordal) metric on the manifold.
Alexander Barg, Dmitry Yu. Nogin
 IEEE Trans. Inf. Theory2