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

Chiaming Lo

dblp:28/86 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 1994
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-authorTheory 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 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory
covering codes		 0.021992
Linear inequalities for covering codes: Part II: Triple covering inequalities · IEEE Trans. Inf. Theory 1992
Lower bounds on t[n, k] from linear inequalities · IEEE Trans. Inf. Theory 1992
Coding theory › error-correcting codes
covering radius		 0.021992
Linear inequalities for covering codes: Part II: Triple covering inequalities · IEEE Trans. Inf. Theory 1992
Lower bounds on t[n, k] from linear inequalities · IEEE Trans. Inf. Theory 1992
Coding theory › error-correcting codes › block codes
linear code		 0.021992
Linear inequalities for covering codes: Part II: Triple covering inequalities · IEEE Trans. Inf. Theory 1992
Lower bounds on t[n, k] from linear inequalities · IEEE Trans. Inf. Theory 1992

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

linear inequality method · 0.0local covering problem · 0.0dual code distance · 0.0
YearPublicationVenuePosition
1994 Error analysis of the MMSE estimator for multidimensional band-limited extrapolations from finite samples
Xiang-Gen Xia 0001, Zhen Zhang 0010, Chiaming Lo
 Signal Process.3
1993 Image coding with a map and vector quantizer
Chiaming Lo
 ICASSP (5)1
1992 Lower bounds on t[n, k] from linear inequalities
abstract
The linear inequality method for covering codes is used to improve the lower bounds of t(n, k), the smallest covering radius of any (n, k) binary linear code. To make better use of the strength of this method, the relation between the covering radius of a code and the minimum distance of its dual code is studied. The authors obtained 65 improved lower bounds for t(n, k) within the range of n>
Zhen Zhang 0010, Chiaming Lo
 IEEE Trans. Inf. Theory2
1992 Linear inequalities for covering codes: Part II: Triple covering inequalities
abstract
For Pt.I, see ibid., vol.37, no.3, p.573-82 (May 1991). The linear inequality method for covering codes is generalized. This method reduces the study of covering codes to the study of some local covering problems. One of these problems, the 1-3 covering system, is formulated and studied in detail. The results for this local covering problem lead to new linear inequalities satisfied by covering codes, which are used to obtain numerous new lower bounds on K(n, R) and t(n, k).>
Zhen Zhang 0010, Chiaming Lo
 IEEE Trans. Inf. Theory2