Demo Data from EDBT 2026 / reviewers in the wild / expert
Yau-Chau Ching
dblp:134/8630
· DBLP profile ↗
3ranked-venue papers
2as first author
0since 2021 · last 1986
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 2 first-authorComputer 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.
| Computer networks
1 paper |
Optical networks · 100% | |
| Theoretical computer science
2 papers |
Information theory · 84% Coding theory · 16% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Optical networks
optical fiber transmission |
0.0 | 1 | 1986 | Standardized Fiber Optic Transmission Systems-A Synchronous Optical Network View · IEEE J. Sel. Areas Commun. 1986 |
Optical networks › optical transmission
SONET |
0.0 | 1 | 1986 | Standardized Fiber Optic Transmission Systems-A Synchronous Optical Network View · IEEE J. Sel. Areas Commun. 1986 |
Information theory › hypothesis testing › signal detection
nonparametric detection |
0.0 | 2 | 1972 | Nonparametric detectors based on m-interval partitioning · IEEE Trans. Inf. Theory 1972 Lower bounds in the capacity of permutation channels · IEEE Trans. Inf. Theory 1971 |
Information theory › hypothesis testing
signal detection |
0.0 | 2 | 1972 | Nonparametric detectors based on m-interval partitioning · IEEE Trans. Inf. Theory 1972 Lower bounds in the capacity of permutation channels · IEEE Trans. Inf. Theory 1971 |
Information theory
channel capacity |
0.0 | 1 | 1971 | Lower bounds in the capacity of permutation channels · IEEE Trans. Inf. Theory 1971 |
Coding theory › channel coding
permutation channel |
0.0 | 1 | 1971 | Lower bounds in the capacity of permutation channels · IEEE Trans. Inf. Theory 1971 |
Methods — techniques the papers use, named apart from their topics
quantile estimation · 0.0nonparametric signal-detection theory · 0.0asymptotic relative efficiency · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1986 | Standardized Fiber Optic Transmission Systems-A Synchronous Optical Network ViewabstractThe deployment of fiber optic systems has drastically altered the complexion of the digital network, and standardization of optical interface parameters has assumed paramount importance. This paper reports on the activities in various standards organizations, with emphasis on a synchronous network proposal which is currently being discussed in the T1 Committee. Rodney J. Boehm, Yau-Chau Ching, George C. Griffith, Frederick A. Saal |
IEEE J. Sel. Areas Commun. | 2 |
| 1972 | Nonparametric detectors based on m-interval partitioningabstractA new class of nonparametric detectors based onm- interval partitioning is introduced. It is easier to treat analytically and implement practically than the widely used class of nonparametric detectors based on rank partitioning of the received signal space. In addition, these new detectors are robust or relatively insensitive to the underlying noise distribution. If the quantiles of the noise distribution are known exactly, the structure of the detector is particularly simple. Some general results for an adaptive system, when the quantiles of the noise distribution must be estimated, were also obtained. Yau-Chau Ching, Ludwik Kurz |
IEEE Trans. Inf. Theory | 1 |
| 1971 | Lower bounds in the capacity of permutation channelsabstractIn this paper, permutation channels, which include the rank channels and doubly uniform channels, are defined. A lower bound on the capacities of these channels is obtained with help of nonparametric signal-detection theory. This bound reduces to the actual capacity for memoryless doubly uniform channels by properly selecting the associated nonparametric detectors, The lower bounds on the capacities of the rank channels are expressed in terms of Kendalrs rank correlation coefficient. When the signal power is low, the comparison between a rank channel and a memoryless binary symmetric channel is expressed in terms of the Pitman-Noether asymptotic relative efficiency. Yau-Chau Ching, Ludwik Kurz |
IEEE Trans. Inf. Theory | 1 |