Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Borui Fang

dblp:322/5802 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
4since 2021 · last 2026
0000-0001-7319-8941ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 3 · 3 first-author · 3 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
2 papers
Distributed systems · 100%
Theoretical computer science
2 papers
Coding theory · 100%
Computer networks
2 papers
Wireless networking · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed systems
coded computation
1.622025
Wireless Merged-r LT Coded Computation: A Low-Latency Design for Non-Linear Tasks · IEEE Trans. Commun. 2025
Wireless Coded Computation With Error Detection · IEEE Trans. Commun. 2024
Coding theory › error-correcting codes
error detection
0.812024
Wireless Coded Computation With Error Detection · IEEE Trans. Commun. 2024
Wireless networking › wireless network protocols
wireless distributed computing
0.522025
Wireless Merged-r LT Coded Computation: A Low-Latency Design for Non-Linear Tasks · IEEE Trans. Commun. 2025
Wireless Coded Computation With Error Detection · IEEE Trans. Commun. 2024
Wireless networking
wireless network protocols
0.522025
Wireless Merged-r LT Coded Computation: A Low-Latency Design for Non-Linear Tasks · IEEE Trans. Commun. 2025
Wireless Coded Computation With Error Detection · IEEE Trans. Commun. 2024
Coding theory
channel coding
0.312025
Wireless Merged-r LT Coded Computation: A Low-Latency Design for Non-Linear Tasks · IEEE Trans. Commun. 2025
Coding theory › error-correcting codes › rateless codes › fountain codes
LT codes
0.312025
Wireless Merged-r LT Coded Computation: A Low-Latency Design for Non-Linear Tasks · IEEE Trans. Commun. 2025

Methods — techniques the papers use, named apart from their topics

maximum degree decoding · 2.6latency optimization · 2.6two-layer encoding · 2.3luby transform codes · 2.3iterative allocation · 2.3
YearPublicationVenuePosition
2026 Heterogeneous Multi-Computing-Units Based LT Coded Computation in Wireless Networks
Borui Fang, Xiaorui Qiao
WCNC1
2025 Wireless Merged-r LT Coded Computation: A Low-Latency Design for Non-Linear Tasks
abstract
Coded computation has attracted significant attention because it can eliminate the stragglers’ effect effectively. Most existing works of coded computation are designed for linear tasks, such as matrix multiplication. They cannot handle non-linear tasks directly, leading to high computation, transmission and decoding latency. This is not suitable for latency-sensitive services. In this paper, considering a non-linear task in wireless heterogeneous networks, we propose an efficient merged-rLuby transform (LT) coded computation scheme based on the rateless and sparse LT code. First, we give the merged-rLT coding strategy to reduce the computation and transmission costs. Then, the maximum degree decoding (MDD) strategy is proposed to speed up the decoding process. Finally, we analyze the latency performance for the whole network by designing the optimal merging parameter and sub-block size. The wireless non-linear merged-rLT coded computation (WNLMrLTCC) algorithm minimizes the total latency. Theoretical analysis and numerical simulation show that our proposed scheme has significant advantages over the existing ones for non-linear tasks.
Borui Fang, Li Chen 0015, Yunfei Chen 0001
IEEE Trans. Commun.1
2024 Wireless Coded Computation With Error Detection
abstract
In wireless networks with distributed computing, the computational performance is limited by stragglers. To mitigate the stragglers’ effect, coded computation is adopted through computational redundancy. Moreover, in wireless transmission, transmission errors may occur due to noise, channel fading and so on. Existing works design coded computation and error detection separately. However, this leads to frequent encoding and inefficient allocation. In this paper, we propose a joint computation and transmission coding (JCTC) scheme to design coded computation and error detection jointly. The coded computation is based on Luby transform (LT) code and linear error-detecting codes are applied for the re-transmission mechanism. To achieve the low dynamic encoding, two-layer encoding is adopted. Then, the performances of JCTC scheme are analyzed in terms of latency and computation reliability. Finally, in order to achieve efficient task and redundancy allocation, the wireless LT coded computation with error detection (WLTCC-ED) algorithm is given from both iterative and low-complexity perspectives respectively. Through theoretical analysis and numerical simulation, it shows that our proposed JCTC scheme has significant advantages over separate designs.
Borui Fang, Li Chen 0015, Yunfei Chen 0001, Changsheng You
IEEE Trans. Commun.1
2023 Luby Transform Coded Computation with Error Detection in Wireless Networks
abstract
In wireless distributed computing, coded computation is adopted through computational redundancy to mitigate the stragglers’ effect. Moreover, transmission errors may occur due to noise, channel fading and so on. Existing works design coded computation and error detection separately. However, this leads to frequent encoding and inefficient allocation. In this paper, we propose a joint computation and transmission coding (JCTC) scheme to design coded computation and error detection jointly. The coded computation is based on Luby transform (LT) code and linear error-detecting codes are applied for the retransmission mechanism. To achieve the low dynamic encoding, two-layer encoding is adopted. Then, the performances of JCTC scheme are analyzed. Finally, in order to achieve efficient task and redundancy allocation, the wireless LT coded computation with error detection (WLTCC-ED) algorithm is given. Through the simulation, it shows that our proposed JCTC scheme has significant advantages over separate designs.
Borui Fang, Li Chen 0015
VTC Fall1