Demo Data from EDBT 2026 / reviewers in the wild / expert
Fuqiang Sun
dblp:187/1863
· DBLP profile ↗
4ranked-venue papers
2as first author
4since 2021 · last 2026
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Theory of computation · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 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.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Storage systems · 100% | |
| 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 |
|---|---|---|---|---|
Storage systems › erasure-coded storage
array code |
1.0 | 1 | 2026 | Binary Dispersed Array Codes for Distributed Storage Systems · IEEE Trans. Inf. Theory 2026 |
Storage systems › storage reliability
erasure coding |
1.0 | 1 | 2026 | Binary Dispersed Array Codes for Distributed Storage Systems · IEEE Trans. Inf. Theory 2026 |
Storage systems
storage reliability |
1.0 | 1 | 2026 | Binary Dispersed Array Codes for Distributed Storage Systems · IEEE Trans. Inf. Theory 2026 |
Coding theory › error-correcting codes
locally recoverable codes |
1.0 | 1 | 2026 | Binary Dispersed Array Codes for Distributed Storage Systems · IEEE Trans. Inf. Theory 2026 |
Coding theory › distributed storage › distributed storage codes
regenerating codes |
1.0 | 1 | 2026 | Binary Dispersed Array Codes for Distributed Storage Systems · IEEE Trans. Inf. Theory 2026 |
Methods — techniques the papers use, named apart from their topics
quasi-cyclic construction · 2.0binary matrix dispersion · 2.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Binary Dispersed Array Codes for Distributed Storage SystemsabstractThis paper proposes to construct binary array codes from nonbinary codes by binary matrix dispersion. Thanks to their low-density and quasi-cyclic generator matrices, thesebinary dispersed array codes(BDACs) enjoy low encoding complexity. Their reconstruction property is characterized through matrix transformation. Several explicit constructions of BDACs from minimum-bandwidth regenerating codes, piggybacking codes, and locally recoverable codes are presented, as well as their similar single-node repair strategies to their nonbinary counterparts. Qin Huang 0002, Guanchen He, Fuqiang Sun |
IEEE Trans. Inf. Theory | 3 |
| 2024 | Construction of Binary Array Codes Based on Matrix TransformationabstractThis paper proposes to construct binary array codes from non-binary codes by binary matrix dispersion. Thanks to their low-density and quasi-cyclic (QC) generator matrices, the proposed codes enjoy low encoding complexity, about$1/(m+1)$of the XOR operations used in their counterparts over$\mathbf{G F}\left(2^m\right)$. Their maximum distance separable (MDS) property and repair can be efficiently analyzed via matrix transformation. The MDS property is ensured by introducing Vandermonde upper triangular form and pre-processing. Moreover, the efficient repair can be guaranteed by applying a matrix mapping called all-one superposition on the associated matrices. Analysis indicates that their code rate and repair ratio asymptotically approach those of their non-binary counterparts. Fuqiang Sun, Guanchen He, Qin Huang 0002 |
ICC | 1 |
| 2023 | Side Encoding for MDS Array CodesabstractThis paper considers the parity-check matrix of a maximum distance separable (MDS) array code as a superposition of two matrices, block diagonal matrix A and side matrix S. By matching their entries, the syndrome calculation of the matrix A can share computations with that of the side matrix S. Then, a low-complexity encoding, referred to as side encoding, is proposed to encode matched MDS array codes efficiently. Moreover, it can combine with the Reed-Muller transform-based (RMTB) Reed-Solomon encoding algorithm to reduce the encoding complexity further. The analysis indicates that for the MDS array code [1] with four parity nodes, the number of multiplications is reduced by 85.4% and 52.6% compared to the traditional encoding and only RMTB encoding, respectively. Fuqiang Sun, Qin Huang 0002, Jiayi Rui, Ting-Yi Wu, Yunghsiang Sam Han |
ISIT | 1 |
| 2022 | Deep residual neural network based PointNet for 3D object part segmentation
Bin Li 0004, Yonghan Zhang, Fuqiang Sun |
Multim. Tools Appl. | 3 |