Demo Data from EDBT 2026 / reviewers in the wild / expert
Edward K. Orcutt
dblp:19/207
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 1993
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 2 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
2 papers |
Coding theory · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory
constrained coding |
0.0 | 2 | 1993 | Redundant multitrack (d, k) codes · IEEE Trans. Inf. Theory 1993 Enumerable multitrack (d, k) block codes · IEEE Trans. Inf. Theory 1993 |
Coding theory › constrained coding › runlength-limited codes
multitrack (d,k) codes |
0.0 | 2 | 1993 | Redundant multitrack (d, k) codes · IEEE Trans. Inf. Theory 1993 Enumerable multitrack (d, k) block codes · IEEE Trans. Inf. Theory 1993 |
Coding theory › constrained coding
runlength-limited codes |
0.0 | 2 | 1993 | Redundant multitrack (d, k) codes · IEEE Trans. Inf. Theory 1993 Enumerable multitrack (d, k) block codes · IEEE Trans. Inf. Theory 1993 |
Coding theory › error-correcting codes
block codes |
0.0 | 1 | 1993 | Enumerable multitrack (d, k) block codes · IEEE Trans. Inf. Theory 1993 |
Coding theory
error-correcting codes |
0.0 | 1 | 1993 | Redundant multitrack (d, k) codes · IEEE Trans. Inf. Theory 1993 |
Coding theory › distributed storage › distributed storage codes
fault-tolerant coding |
0.0 | 1 | 1993 | Redundant multitrack (d, k) codes · IEEE Trans. Inf. Theory 1993 |
Methods — techniques the papers use, named apart from their topics
trellis description · 0.0k-constraint relaxation · 0.0enumeration scheme · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1993 | Enumerable multitrack (d, k) block codesabstractMultitrack run-length-limited (d, k) modulation codes were recently introduced as a method to increase storage densities in magnetic and optical recording systems. These codes are a generalization of the usual run-length-limited (d, k) codes and provide for increased storage density by relaxing the k-constraint and encoding multiple tracks in parallel. This paper introduces a method to construct multitrack (d, k) block codes which are implemented via an enumeration scheme based on the trellis description of the (d, k) constraints. This implementation results in memory requirements which increase only linearly with block length as opposed to the exponential increases arising from look-up table implementations of block codes.> Edward K. Orcutt, Michael W. Marcellin |
IEEE Trans. Inf. Theory | 1 |
| 1993 | Redundant multitrack (d, k) codesabstractMultitrack run-length-limited (d, k) modulation codes were recently introduced as a method to increase storage densities in magnetic and optical recording systems. These codes are a generalization of the usual run-length-limited (d, K) codes and provide for increased storage density by relaxing the k-constraint and encoding multiple tracks in parallel. Previously, n-track (d, K) codes used all n tracks to satisfy the K constraint causing synchronization to be completely intolerant of faulty tracks. The authors present multitrack (d, k) codes which allow for r faulty tracks by mandating that all subsets of n-r tracks satisfy the K constraint.> Edward K. Orcutt, Michael W. Marcellin |
IEEE Trans. Inf. Theory | 1 |