EDBT 2026 Demo / reviewers in the wild / expert

L. M. H. E. Driessen

dblp:31/581 · 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 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › q-ary codes
binary codes		 0.011984
On an infinite series of [4n, 2n] binary codes · IEEE Trans. Inf. Theory 1984
Coding theory
error-correcting codes		 0.011984
On an infinite series of [4n, 2n] binary codes · IEEE Trans. Inf. Theory 1984
Coding theory › error-correcting codes › decoding › majority-logic decoding
majority-logic decodable codes		 0.011984
On an infinite series of [4n, 2n] binary codes · IEEE Trans. Inf. Theory 1984
Coding theory › error-correcting codes
unequal error protection codes		 0.011984
On an infinite series of [4n, 2n] binary codes · IEEE Trans. Inf. Theory 1984
Coding theory › error-correcting codes › block codes › linear code
code parameters		 0.011984
On an infinite series of [4n, 2n] binary codes · IEEE Trans. Inf. Theory 1984
Coding theory › error-correcting codes
weight distribution		 0.011984
On an infinite series of [4n, 2n] binary codes · IEEE Trans. Inf. Theory 1984

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

pasting construction · 0.0
YearPublicationVenuePosition
1984 On an infinite series of [4n, 2n] binary codes
abstract
This correspondence deals with an infinite series of binary, reversible[4n, 2n, 4], n \geq 2, unequal error protection codes, which are majority logic decodable. The weight enumerators and automorphism groups are determined completely. For n even the codes are self dual. By pasting together copies of a[4n,2n,4]code, binary codes with parameters[8n,2n,8]forn \geq 2, [8n,2n,12]forn \geq 4, and[12n,2n,16]and[16n,2n,24]forn \geq 3are obtained.
L. M. H. E. Driessen
 IEEE Trans. Inf. Theory1