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 VLDB 2026 / reviewers in the wild / expert

K. C. Fung

dblp:122/3209 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1972
—ORCID · none

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

Theory of computation · 2

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
2 papers
Coding theory · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
cyclic codes		 0.021972
Permutation decoding of certain triple-error-correcting binary codes (Corresp.) · IEEE Trans. Inf. Theory 1972
On permutation decoding of binary cyclic double-error-correcting codes of certain lengths (Corresp.) · IEEE Trans. Inf. Theory 1970
Coding theory
error-correcting codes		 0.021972
Permutation decoding of certain triple-error-correcting binary codes (Corresp.) · IEEE Trans. Inf. Theory 1972
On permutation decoding of binary cyclic double-error-correcting codes of certain lengths (Corresp.) · IEEE Trans. Inf. Theory 1970
Coding theory › error-correcting codes › decoding › decoding algorithms › decoding of block codes
permutation decoding		 0.021972
Permutation decoding of certain triple-error-correcting binary codes (Corresp.) · IEEE Trans. Inf. Theory 1972
On permutation decoding of binary cyclic double-error-correcting codes of certain lengths (Corresp.) · IEEE Trans. Inf. Theory 1970
Coding theory › error-correcting codes › error detection and correction › multiple error correction
triple-error-correcting codes		 0.011972
Permutation decoding of certain triple-error-correcting binary codes (Corresp.) · IEEE Trans. Inf. Theory 1972
Coding theory › error-correcting codes › error detection and correction › multiple error correction
double-error-correcting codes		 0.011970
On permutation decoding of binary cyclic double-error-correcting codes of certain lengths (Corresp.) · IEEE Trans. Inf. Theory 1970

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

permutation decoding · 0.0
YearPublicationVenuePosition
1972 Permutation decoding of certain triple-error-correcting binary codes (Corresp.)
abstract
In a recent note [1] an analysis of certain binary double-error-correcting cyclic codes was made from the point of view of permutation decodability. Specifically, upper bounds on the rates of these codes were established so that the codes would be permutation decodable. The object of the present correspondence is to give corresponding results for binary triple-error-correcting cyclic codes of certain lengths.
Saligram G. S. Shiva, K. C. Fung
 IEEE Trans. Inf. Theory2
1970 On permutation decoding of binary cyclic double-error-correcting codes of certain lengths (Corresp.)
Saligram G. S. Shiva, K. C. Fung, H. S. Y. Tan
 IEEE Trans. Inf. Theory2