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

Frans Merkx

dblp:29/2642 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1986
—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		 0.011986
Linear binary code for write-once memories · IEEE Trans. Inf. Theory 1986
Coding theory › error-correcting codes › storage coding › write-once memory
write-once memory codes		 0.011986
Linear binary code for write-once memories · IEEE Trans. Inf. Theory 1986

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

golay code construction · 0.0
YearPublicationVenuePosition
1986 Linear binary code for write-once memories
abstract
An application of error-correcting codes to "write-once" memories (WOM's) as defined by Rivest and Shamir is studied. Large classes of "WOM codes" that are easily decodable are obtained. In particular, a construction allowing three successive writings of11bits on23positions is derived from the Golay code.
Gérard D. Cohen, Philippe Godlewski, Frans Merkx
 IEEE Trans. Inf. Theory3