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

Keith Pickavance

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

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

Computer networks · 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 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › decoding › algebraic decoding
berlekamp-massey algorithm		 0.012004
A modified Blahut algorithm for decoding Reed-Solomon codes beyond half the minimum distance · IEEE Trans. Commun. 2004
Coding theory › error-correcting codes › decoding › decoding algorithms
decoding beyond half minimum distance		 0.012004
A modified Blahut algorithm for decoding Reed-Solomon codes beyond half the minimum distance · IEEE Trans. Commun. 2004
Coding theory › error-correcting codes
reed-solomon codes		 0.012004
A modified Blahut algorithm for decoding Reed-Solomon codes beyond half the minimum distance · IEEE Trans. Commun. 2004

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

blahut algorithm · 0.0analytical continuation · 0.0
YearPublicationVenuePosition
2004 A modified Blahut algorithm for decoding Reed-Solomon codes beyond half the minimum distance
abstract
A modification of the Blahut algorithm is proposed for decoding of Reed-Solomon codes beyond half the minimum distance. An effective method is offered for the searching of unknown discrepancies needed for analytical continuation of the Berlekamp-Massey algorithm through two additional iterations. This reduces the search time by 2(q-1)n/((n+t+1)(n-t)) times, compared with the Blahut algorithm. An architecture of a searcher for unknown discrepancies is given. The coding gain of the proposed algorithm is shown for some practical codes.
Sergey Egorov, Garegin Markarian, Keith Pickavance
 IEEE Trans. Commun.3