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 SIGIR 2026 / reviewers in the wild / expert

G. Tenengolts

dblp:35/4622 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1984
—ORCID · none

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

Theory 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 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
insertion-deletion codes		 0.011984
Nonbinary codes, correcting single deletion or insertion · IEEE Trans. Inf. Theory 1984
Coding theory › error-correcting codes › q-ary codes
nonbinary codes		 0.011984
Nonbinary codes, correcting single deletion or insertion · IEEE Trans. Inf. Theory 1984

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

enumerative coding · 0.0
YearPublicationVenuePosition
1984 Nonbinary codes, correcting single deletion or insertion
abstract
In many digital communications systems, bursts of insertions or deletions are typical errors. A new class of nonbinary codes is proposed that correct a single deletion or insertion. Asymptotically, the cardinality of these codes is close to optimal. The codes can be easily implemented.
G. Tenengolts
 IEEE Trans. Inf. Theory1