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

Erik Jacobsson

dblp:16/10399 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2011
—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 3 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.112011
Results on Binary Linear Codes With Minimum Distance 8 and 10 · IEEE Trans. Inf. Theory 2011
Coding theory › error-correcting codes › coding bounds
linear code bounds		 0.112011
Results on Binary Linear Codes With Minimum Distance 8 and 10 · IEEE Trans. Inf. Theory 2011
Coding theory › error-correcting codes › block codes › linear code
linear code classification		 0.112011
Results on Binary Linear Codes With Minimum Distance 8 and 10 · IEEE Trans. Inf. Theory 2011

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

maximum clique algorithm · 0.1dual code extension · 0.1
YearPublicationVenuePosition
2011 Results on Binary Linear Codes With Minimum Distance 8 and 10
abstract
All linear binary codes with minimum distance 8 and codimension up to 14 and all codes with minimum distance 10 and codimension up to 18 are classified. Nonexistence of codes with parameters [33,18,8] and [33,14,10] is proved. This leads to 8 new exact bounds for binary linear codes. Primarily two algorithms considering the dual codes are used, namely extension of dual codes with a proper coordinate, and a fast algorithm for finding a maximum clique in a graph, which is modified to find a maximum set of vectors with the right dependency structure.
Iliya Bouyukliev, Erik Jacobsson
 IEEE Trans. Inf. Theory2