Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
VLDB 2026 Research / reviewers in the wild / expert

V. Ponnampalam

dblp:37/3609 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2005
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › decoding
list decoding		 0.112005
Soft-in soft-out decoding of Reed-Solomon codes based on Vardy and Be'ery's decomposition · IEEE Trans. Inf. Theory 2005
Coding theory › error-correcting codes
reed-solomon codes		 0.112005
Soft-in soft-out decoding of Reed-Solomon codes based on Vardy and Be'ery's decomposition · IEEE Trans. Inf. Theory 2005
Coding theory › error-correcting codes › decoding › iterative decoding
soft-input soft-output decoding		 0.112005
Soft-in soft-out decoding of Reed-Solomon codes based on Vardy and Be'ery's decomposition · IEEE Trans. Inf. Theory 2005
Coding theory › error-correcting codes › decoding
iterative decoding		 0.012005
Soft-in soft-out decoding of Reed-Solomon codes based on Vardy and Be'ery's decomposition · IEEE Trans. Inf. Theory 2005

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

vardy-be'ery decomposition · 0.1
YearPublicationVenuePosition
2005 Soft-in soft-out decoding of Reed-Solomon codes based on Vardy and Be'ery's decomposition
abstract
This correspondence presents an optimal soft-in soft-out (SISO) decoding algorithm for the binary image of Reed-Solomon (RS) codes that is based on Vardy and Be'ery's optimal soft-in hard-out algorithm. A novel suboptimal list-based SISO decoder that exploits Vardy and Be'ery's decomposition is also presented. For those codes with very high rate, which allows practical decoding with the proposed algorithms, the proposed suboptimal SISO significantly outperforms standard list-based decoding techniques in iteratively decoded systems.
Thomas R. Halford, V. Ponnampalam, Alex J. Grant, Keith M. Chugg
 IEEE Trans. Inf. Theory2