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

Jenn-Dong Sun

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

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

Systems, architecture and hardware · 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
0.011993
On Theory and Fast Algorithms for Error Correction in Residue Number System Product Codes · IEEE Trans. Computers 1993
Coding theory › error-correcting codes › error detection and correction
multiple error correction
0.011993
On Theory and Fast Algorithms for Error Correction in Residue Number System Product Codes · IEEE Trans. Computers 1993
Coding theory › error-correcting codes › arithmetic codes
residue number system codes
0.011993
On Theory and Fast Algorithms for Error Correction in Residue Number System Product Codes · IEEE Trans. Computers 1993

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

residue number system · 0.0product codes · 0.0
YearPublicationVenuePosition
1993 On Theory and Fast Algorithms for Error Correction in Residue Number System Product Codes
abstract
The authors develop a coding theory approach to error control in residue number system product codes. Based on this coding theory framework, computationally efficient algorithms are derived for correcting single errors, double errors, and multiple errors, and simultaneously detecting multiple errors and additive overflow. These algorithms have lower computational complexity than previously known algorithms by at least an order of magnitude. In addition, it is noted that all the literature published thus far deals almost exclusively with single error correction.>
Hari Krishna, Jenn-Dong Sun
IEEE Trans. Computers2