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

S. Grosse

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

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

Theory of computation · 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 · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › block codes › linear code
binary linear codes		 0.011994
New binary codes · IEEE Trans. Inf. Theory 1994
Coding theory › error-correcting codes
code construction		 0.011994
New binary codes · IEEE Trans. Inf. Theory 1994

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

shortening · 0.0puncturing · 0.0code transfer over GF(4) · 0.0
YearPublicationVenuePosition
1994 New binary codes
abstract
We report on the construction of many binary linear codes improving the tables of the best known codes. We obtained our results by applying the following known constructions: shortening and puncturing codes by analyzing their duals; and transferring a [64,8,43] code over GF(4) into a binary code and applying various constructions to the resulting code.>
B. Groneick, S. Grosse
 IEEE Trans. Inf. Theory2