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.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

N. Suresh Babu

dblp:53/2055 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2001
—ORCID · unresolved

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

Theory of computation · 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 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
algebraic coding theory		 0.012001
Decoding of linear codes over Galois rings · IEEE Trans. Inf. Theory 2001
Coding theory › error-correcting codes › decoding
decoding algorithms		 0.012001
Decoding of linear codes over Galois rings · IEEE Trans. Inf. Theory 2001

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

galois ring theory · 0.0finite field theory · 0.0
YearPublicationVenuePosition
2001 Decoding of linear codes over Galois rings
abstract
We present a method for decoding an arbitrary linear code over a Galois ring /spl Rscr/ by a process of lifting decoding algorithms for a family of linear codes over a finite field /spl Kscr/ forming an /spl alpha/-element chain, where /spl Kscr/ is the quotient field of /spl Rscr/ and /spl Rscr/ has characteristic p/sup /spl alpha//. As a new result, this method also works for linear codes over /spl Rscr/ which are nonfree /spl Rscr/-modules.
N. Suresh Babu, Karl-Heinz Zimmermann
 IEEE Trans. Inf. Theory1