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

Michael Navon

dblp:88/2038 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2009
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorTheory of computation · 1 · 1 first-author

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 · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › coding bounds
linear programming bounds		 0.112005
On Delsarte's Linear Programming Bounds for Binary Codes · FOCS 2005

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

linear programming duality · 0.1induction · 0.1
YearPublicationVenuePosition
2009 Linear Programming Bounds for Codes via a Covering Argument
Michael Navon, Alex Samorodnitsky
 Discret. Comput. Geom.1
2005 On Delsarte's Linear Programming Bounds for Binary Codes
abstract
We prove two results about the value of Delsarte 's linear program for binary codes. Our main result is a new lower bound on the value of the program, which, in particular, is nearly tight for low rate codes. We also give an easy proof of a (known) upper bound, which coincides with the best known bound for a wide range of parameters.
Michael Navon, Alex Samorodnitsky
 FOCS1