Demo Data from EDBT 2026 / reviewers in the wild / expert
Ting-Ann Lee
dblp:10/5249
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 1988
—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 · 77% Information theory · 23% |
Topics — the 5 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory
trellis codes |
0.0 | 1 | 1988 | Baseband trellis codes with a spectral null at zero · IEEE Trans. Inf. Theory 1988 |
Coding theory › error-correcting codes
convolutional codes |
0.0 | 1 | 1986 | Binary convolutional codes with application to magnetic recording · IEEE Trans. Inf. Theory 1986 |
Information theory › communication channels › channel models › channels with memory
partial-response channel |
0.0 | 1 | 1986 | Binary convolutional codes with application to magnetic recording · IEEE Trans. Inf. Theory 1986 |
Coding theory
magnetic recording |
0.0 | 1 | 1986 | Binary convolutional codes with application to magnetic recording · IEEE Trans. Inf. Theory 1986 |
Coding theory › constrained coding
runlength-limited codes |
0.0 | 1 | 1986 | Binary convolutional codes with application to magnetic recording · IEEE Trans. Inf. Theory 1986 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1988 | Baseband trellis codes with a spectral null at zeroabstractA method is described for modifying classical N-dimensional trellis codes to provide baseband codes that combine a spectral null at DC with significant coding gain. The information rate of the classical code is decreased by one bit, and this extra redundancy is used to keep the running digital sum bounded. Equivalently, if the rate is held constant, then twice as many signal points are needed, causing a power penalty of 6/N dB. Baseband trellis codes are presented for several information rates together with complete spectral plots and performance comparisons. A method of constructing baseband codes with multiple spectral nulls is also described.> A. Robert Calderbank, Ting-Ann Lee, James E. Mazo |
IEEE Trans. Inf. Theory | 2 |
| 1986 | Binary convolutional codes with application to magnetic recordingabstractCalderbank, Heegard, and Ozarow [1] have suggested a method of designing codes for channels with intersymbol interference, such as the magnetic recording channel. These codes are designed to exploit intersymbol interference. The standard method is to minimize intersymbol interference by constraining the input to the channel using run-length limited sequences. Calderbank, Heegard, and Ozarow considered an idealized model of an intersymbol interference channel that leads to the problem of designing codes for a partial response channel with transfer function(1 - D^{N}) /2, where the channel inputs are constrained to be\pm 1. This problem is considered here. Channel inputs are generated using a nontrivial coset of a binary convolutional code. The coset is chosen to limit the zero-run length of the output of the channel and so maintain clock synchronization. The minimum squared Euclidean distance between outputs corresponding to distinct inputs is bounded below by the free distance of a second convolutional code which we call the magnitude code. An interesting feature of the analysis is that magnitude codes that are catastrophic may perform better than those that are noncatastrophic. A. Robert Calderbank, Chris Heegard, Ting-Ann Lee |
IEEE Trans. Inf. Theory | 3 |