Demo Data from EDBT 2026 / reviewers in the wild / expert
Jinni Chen
dblp:263/8569
· DBLP profile ↗
2ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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 |
Physical-layer communications · 77% Cellular and mobile networks · 23% | |
| Theoretical computer science
1 paper |
Coding theory · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Physical-layer communications
MIMO |
0.9 | 1 | 2025 | Explicit Performance Bound of Finite Blocklength Coded MIMO: Time-Domain Versus Spatiotemporal Channel Coding · IEEE Trans. Commun. 2025 |
Coding theory › channel coding
finite blocklength coding |
0.9 | 1 | 2025 | Explicit Performance Bound of Finite Blocklength Coded MIMO: Time-Domain Versus Spatiotemporal Channel Coding · IEEE Trans. Commun. 2025 |
Cellular and mobile networks › low-latency communication
ultra-reliable low-latency communication |
0.3 | 1 | 2025 | Explicit Performance Bound of Finite Blocklength Coded MIMO: Time-Domain Versus Spatiotemporal Channel Coding · IEEE Trans. Commun. 2025 |
Methods — techniques the papers use, named apart from their topics
normal approximation · 1.7information density analysis · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Explicit Performance Bound of Finite Blocklength Coded MIMO: Time-Domain Versus Spatiotemporal Channel CodingabstractIn the sixth generation (6G), ultra-reliable low-latency communications (URLLC) will be further developed to achieve TKμ extreme connectivity. On the premise of ensuring the same rate and reliability, the spatial domain advantage of multiple-input multiple-output (MIMO) has the potential to further shorten the time-domain code length and is expected to be a key enabler for the realization of TKμ. Different coded MIMO schemes exhibit disparities in exploiting the spatial domain characteristics, so we consider two extreme MIMO coding schemes, namely, time-domain coding in which the codewords on multiple spatial channels are independent of each other, and spatiotemporal coding in which multiple spatial channels are jointly coded. By analyzing the statistical characteristics of information density and utilizing the normal approximation, we provide explicit performance bounds for finite blocklength coded MIMO under time-domain coding and spatiotemporal coding. It is found that, different from the phenomenon in time-domain coding where the performance degrades as the blocklengths decrease, spatiotemporal coding can effectively compensate for the performance loss caused by short blocklengths by improving the spatial degrees of freedom (DoF). These results indicate that spatiotemporal coding can fully exploit the spatial dimension advantages of MIMO systems, enabling extremely low error-rate communication under stringent blocklengths constraint. Feng Ye 0001, Xiaohu You 0001, Jiamin Li 0001, Jinni Chen, Chuan Zhang 0001 |
IEEE Trans. Commun. | 4 |
| 2020 | Non-reference image quality assessment based on deep clustering
Jinni Chen, Peng Song 0024, Kaili Jia |
Signal Process. Image Commun. | 3 |