Demo Data from SIGIR 2026 / reviewers in the wild / expert
Sanker S. Malladi
dblp:120/6558
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1994
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 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 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory
error-correcting codes |
0.0 | 1 | 1994 | Construction of trellis codes with a good distance profile · IEEE Trans. Commun. 1994 |
Coding theory › error-correcting codes › decoding
sequential decoding |
0.0 | 1 | 1994 | Construction of trellis codes with a good distance profile · IEEE Trans. Commun. 1994 |
Coding theory › trellis codes
trellis code design |
0.0 | 1 | 1994 | Construction of trellis codes with a good distance profile · IEEE Trans. Commun. 1994 |
Coding theory › error-correcting codes › coded modulation
trellis-coded modulation |
0.0 | 1 | 1994 | Construction of trellis codes with a good distance profile · IEEE Trans. Commun. 1994 |
Methods — techniques the papers use, named apart from their topics
nested step-by-step construction · 0.0fano algorithm · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1994 | Construction of trellis codes with a good distance profileabstractSystematic feedforward trellis codes for 8-PSK and 16-QAM modulation are constructed using a nested step by step algorithm which guarantees a good distance profile. This makes the codes suitable for use with sequential decoding, where a rapidly growing distance profile is needed to reduce the average number of computations. In addition to having a good distance profile, the new codes achieve asymptotic coding gains of up to 6.53 dB. A procedure based upon the Fano (1963) algorithm (FA) is used to calculate the free distance of the new codes. This procedure is very effective for finding the free distances of long trellis codes because of the computational and storage efficiency of the FA. From a comparison of the new systematic feedforward codes with Ungerboeck's (1982, 1987) systematic feedback codes, the authors conjecture that a systematic feedforward code of constraint length 2/spl nu/ can achieve the same free distance as a systematic feedback code of constraint length /spl nu/.> Sanker S. Malladi, Fu-Quan Wang, Daniel J. Costello Jr., Hendrik C. Ferreira |
IEEE Trans. Commun. | 1 |