Demo Data from EDBT 2026 / reviewers in the wild / expert
Yongfeng Niu
dblp:198/7603
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2025
0000-0002-5830-8863ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 1 · 1 since 2021Theory of computation · 1 · 1 since 2021
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 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes
cyclic codes |
0.9 | 1 | 2025 | Non-Reed-Solomon Type Cyclic MDS Codes · IEEE Trans. Inf. Theory 2025 |
Coding theory › error-correcting codes › block codes › MDS codes
cyclic MDS codes |
0.9 | 1 | 2025 | Non-Reed-Solomon Type Cyclic MDS Codes · IEEE Trans. Inf. Theory 2025 |
Coding theory › error-correcting codes › block codes
MDS codes |
0.9 | 1 | 2025 | Non-Reed-Solomon Type Cyclic MDS Codes · IEEE Trans. Inf. Theory 2025 |
Methods — techniques the papers use, named apart from their topics
schur square · 0.9polynomial equations · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Non-Reed-Solomon Type Cyclic MDS CodesabstractAs cyclic codes and maximum distance separable (MDS) codes, cyclic MDS codes have very nice structures and properties, which have been intensively investigated in literature due to their theoretical interest and practical importance. Particularly, abundant cyclic MDS codes have been determined and constructed for many parameters and most of them were proved to be equivalent to generalized Reed-Solomon (GRS) codes. Hence it is a challenging task to construct non-Reed-Solomon type cyclic MDS codes. In this work, we obtain many new cyclic MDS codes for certain parameters by determining the solutions of the system of polynomial equations. Moreover, by determining the dimension of the Schur square of an MDS code, we can easily show that all of our constructed codes are not equivalent to GRS codes. Fagang Li, Hao Chen 0029, Yongfeng Niu |
IEEE Trans. Inf. Theory | 4 |
| 2021 | MDS or NMDS self-dual codes from twisted generalized Reed-Solomon codes
Daitao Huang, Qin Yue 0001, Yongfeng Niu |
Des. Codes Cryptogr. | 3 |