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

Frank H. Böinck

dblp:82/3182 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1990
—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
0.011990
Constructions and bounds for systematic t EC/AUED codes · IEEE Trans. Inf. Theory 1990
Coding theory › error-correcting codes › error detection
unidirectional error detecting codes
0.011990
Constructions and bounds for systematic t EC/AUED codes · IEEE Trans. Inf. Theory 1990

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

code construction · 0.0
YearPublicationVenuePosition
1990 Constructions and bounds for systematic t EC/AUED codes
abstract
Several methods of constructing systematic t-error correcting/all unidirectional error-detecting codes are described. These codes can be constructed by adding a tail to a linear t-error correcting code, but other constructions presented are more of an ad hoc nature. These codes will often be found as suitably chosen subsets of nonsystematic tEC/AUED codes. Further bounds on the word length of systematic tEC/AUED codes are derived, and extensive tables are given.>
Frank H. Böinck, Henk C. A. van Tilborg
IEEE Trans. Inf. Theory1