Demo Data from EDBT 2026 / reviewers in the wild / expert
Lijia Yang
dblp:192/6160
· DBLP profile ↗
3ranked-venue papers
2as first author
2since 2021 · last 2025
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1Human-computer interaction and ubiquitous computing · 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 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes › cyclic codes
BCH codes |
0.9 | 1 | 2025 | Efficient Ordered Statistics Decoding of BCH Codes Without Gaussian Elimination · IEEE Trans. Inf. Theory 2025 |
Coding theory › error-correcting codes › decoding
decoding algorithms |
0.9 | 1 | 2025 | Efficient Ordered Statistics Decoding of BCH Codes Without Gaussian Elimination · IEEE Trans. Inf. Theory 2025 |
Coding theory
error-correcting codes |
0.9 | 1 | 2025 | Efficient Ordered Statistics Decoding of BCH Codes Without Gaussian Elimination · IEEE Trans. Inf. Theory 2025 |
Coding theory › error-correcting codes › decoding › soft-decision decoding
ordered statistics decoding |
0.9 | 1 | 2025 | Efficient Ordered Statistics Decoding of BCH Codes Without Gaussian Elimination · IEEE Trans. Inf. Theory 2025 |
Coding theory › error-correcting codes
reed-solomon codes |
0.9 | 1 | 2025 | Efficient Ordered Statistics Decoding of BCH Codes Without Gaussian Elimination · IEEE Trans. Inf. Theory 2025 |
Methods — techniques the papers use, named apart from their topics
soft decoding · 0.9ordered statistics decoding · 0.9gaussian elimination · 0.9chase decoding · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Efficient Ordered Statistics Decoding of BCH Codes Without Gaussian EliminationabstractOrdered statistics decoding (OSD) can achieve near maximum likelihood (ML) decoding performance for BCH codes. However, Gaussian elimination (GE) that delivers the systematic generator matrix of the code has an uncompromised latency. Addressing this challenge, this paper proposes a low-latency OSD (LLOSD) for BCH codes. Since BCH codes are binary subcodes of Reed-Solomon (RS) codes, codeword candidates can be produced using the RS systematic generator matrix, whose entries can be generated in parallel. By eliminating the non-binary codeword candidates and identifying the ML codeword, the LLOSD yields a lower latency as well as complexity than the OSD. It is shown that the LLOSD can be interpreted as generating the codeoword candidates through systematic encoding of a punctured BCH codeword, explaining its low-complexity feature. Moreover, the segmented variant is proposed to further facilitate the LLOSD. In order to decode long BCH codes, a hybrid soft decoding (HSD) is finally proposed. It integrates the LLOSD and the algebraic Chase decoding that can effectively provide extra TEPs for the LLOSD, enhancing the decoding performance. Both the complexity and performance of the proposed decoding are analyzed, demonstrating their advantage over the relevant state-of-the-art decoding. Lijia Yang, Xihao Li, Li Chen 0013, Huazi Zhang, Jiajie Tong |
IEEE Trans. Inf. Theory | 1 |
| 2022 | Low-Latency Ordered Statistics Decoding of BCH CodesabstractThis paper proposes a low-latency ordered statistics decoding (OSD) algorithm for BCH codes. The OSD latency is mainly caused by Gaussian elimination (GE) that produces a systematic generator matrix of the code. Considering BCH codes is binary subcodes of Reed-Solomon (RS) codes, we show that the BCH codeword candidates can be produced through the systematic generator matrix of the corresponding RS code. The systematic generator matrix of an RS code can be formed by generating the linearly independent RS codewords in parallel, replacing the GE process and enabling a low OSD latency. This paper further proposes a segmented variant that facilitates the decoding by reducing the number of test error patterns (TEPs). Complexity of the proposed OSD is also analyzed. Our simulation results show that the proposed decoding can achieve a similar performance as the conventional OSD, but with a lower decoding complexity. The decoding latency can be reduced over the conventional OSD substantially. Lijia Yang, Li Chen 0013 |
ITW | 1 |
| 2016 | MuSeeCol: A See-through Multi-touch Surface for Face-to-face Musical CollaborationabstractMuSeeCol is a collaborative music creation system that allows two users to jointly and playfully compose melodic or percussive music. Collaborative music is rendered when two face-to-face users interact with their respective side of a see-through multi-touch sensitive acrylic panel. We present user study findings from nine pairs of individuals who have used the MuSeeCol system collaboratively and summarize some general observations of what types of interaction designs make for effective face-to-face collaboration. Wooi-Boon Goh, Lijia Yang, Kian Leong Ong |
ACE | 2 |