EDBT 2026 Demo / reviewers in the wild / expert
Weiqiong Wang
dblp:77/3726
· DBLP profile ↗
4ranked-venue papers
1as first author
2since 2021 · last 2024
0000-0002-9650-3563ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 2 · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-authorTheory of computation · 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 · 77% Combinatorics and discrete mathematics · 23% |
Topics — the 1 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes › block codes › linear code
binary linear codes |
0.4 | 1 | 2020 | Optimal Binary Linear Codes From Maximal Arcs · IEEE Trans. Inf. Theory 2020 |
Methods — techniques the papers use, named apart from their topics
distance-optimality analysis · 0.4code construction · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Constructions of plateaued correctors with high correction order and good nonlinearity via Walsh spectral neutralization technique
Shuyu Luo, Weiqiong Wang, Zhenjie Song |
Des. Codes Cryptogr. | 2 |
| 2022 | Linear complexity over ${\mathbb {F}_{{q}}}$ and 2-adic complexity of a class of binary generalized cyclotomic sequences with good autocorrelation
Xilin Han, Weiqiong Wang, Ziling Heng |
Des. Codes Cryptogr. | 3 |
| 2020 | Optimal Binary Linear Codes From Maximal ArcsabstractThe binary Hamming codes with parameters [2m-1, 2m-1- m, 3] are perfect. Their extended codes have parameters [2m, 2m- 1 - m, 4] and are distance-optimal. The first objective of this paper is to construct a class of binary linear codes with parameters [2m+s+ 2s- 2m, 2m+s+ 2s- 2m- 2m -2, 4], which have better information rates than the class of extended binary Hamming codes, and are also distance-optimal. The second objective is to construct a class of distance-optimal binary codes with parameters [2m+2, 2m-2m, 6]. Both classes of binary linear codes have new parameters. Ziling Heng, Cunsheng Ding, Weiqiong Wang |
IEEE Trans. Inf. Theory | 3 |
| 2005 | Distance measure between intuitionistic fuzzy sets
Weiqiong Wang, Xiaolong Xin 0001 |
Pattern Recognit. Lett. | 1 |