EDBT 2026 Demo / reviewers in the wild / expert
D. A. Wright
dblp:86/6047
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 1991
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2
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
2 papers |
Coding theory · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes
convolutional codes |
0.0 | 2 | 1991 | Some new rate R = k/n (2 leq k leq n-2) systematic convolutional codes with good distance profiles · IEEE Trans. Inf. Theory 1991 Hamming distance preserving mappings and trellis codes with constrained binary symbols · IEEE Trans. Inf. Theory 1989 |
Coding theory › error-correcting codes › convolutional codes
distance profile |
0.0 | 1 | 1991 | Some new rate R = k/n (2 leq k leq n-2) systematic convolutional codes with good distance profiles · IEEE Trans. Inf. Theory 1991 |
Coding theory › error-correcting codes › convolutional codes
systematic convolutional code |
0.0 | 1 | 1991 | Some new rate R = k/n (2 leq k leq n-2) systematic convolutional codes with good distance profiles · IEEE Trans. Inf. Theory 1991 |
Coding theory
trellis codes |
0.0 | 1 | 1989 | Hamming distance preserving mappings and trellis codes with constrained binary symbols · IEEE Trans. Inf. Theory 1989 |
Methods — techniques the papers use, named apart from their topics
code search · 0.0tree search · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1991 | Some new rate R = k/n (2 leq k leq n-2) systematic convolutional codes with good distance profilesabstractSeven new systematic convolutional codes with good distance profiles, mostly of rates not previously investigated, have been found. New systematic convolutional codes of rates R=k/n, 4> Hendrik C. Ferreira, D. A. Wright, Albertus S. J. Helberg, Ian S. Shaw, C. R. Wyman |
IEEE Trans. Inf. Theory | 2 |
| 1989 | Hamming distance preserving mappings and trellis codes with constrained binary symbolsabstractThe transformation of a linear convolutional code into a run-length-constrained or balanced trellis code with the same or larger free distance is investigated. The transformation involves a Hamming-distance-preserving mapping of the set of unconstrained binary symbols of the convolutional code onto a set of suitably constrained symbols. Simple tests to determine if these mappings can exist and a tree search algorithm for finding such mappings are presented.> Hendrik C. Ferreira, D. A. Wright, Andre L. Nel |
IEEE Trans. Inf. Theory | 2 |