activity
20092026
most citedBatched Sparse Codes

146 citations · 267 across the 27 of their papers we have counts for

collaborators

27 papers

cs.LG2026

PRISM: Distribution-free Adaptive Computation of Matrix Functions for Accelerating Neural Network Training

Shenghao Yang, Zhichao Wang, Oleg Balabanov +2

Matrix functions such as square root, inverse roots, and orthogonalization play a central role in preconditioned gradient methods for neural network training. This has motivated th…

cs.IT2025

Joint Scheduling and Multiflow Maximization in Wireless Networks

Yanxiao Liu, Shenghao Yang, Cheuk Ting Li

Towards the development of 6G mobile networks, it is promising to integrate a large number of devices from multi-dimensional platforms, and it is crucial to have a solid understand…

cs.IT2023

Weight Distribution of Repeated-Root Cyclic Codes with Prime Power Lengths

Wei Zhao, Weixian Li, Shenghao Yang +2

Determining the weight distribution of a linear code is a classical and fundamental topic in coding theory that has been extensively investigated. Repeated-root cyclic codes, which…

cs.IT2021

Repeated-root Constacyclic Codes with Optimal Locality

Wei Zhao, Kenneth W. Shum, Shenghao Yang

A code is called a locally repairable code (LRC) if any code symbol is a function of a small fraction of other code symbols. When a locally repairable code is employed in a distrib…

cs.IT2021

Wireless Network Scheduling with Discrete Propagation Delays: Theorems and Algorithms

Shenghao Yang, Jun Ma, Yanxiao Liu

This paper focuses on the link scheduling problem in networks where signal delays between nodes are multiples of a time interval. To model such networks, a directed hypergraph is e…

cs.IT2021★ 15 cited

Small-Sample Inferred Adaptive Recoding for Batched Network Coding

Jie Wang, Zhiyuan Jia, Hoover H. F. Yin +1

Batched network coding is a low-complexity network coding solution to feedbackless multi-hop wireless packet network transmission with packet loss. The data to be transmitted is en…

cs.IT2021★ 6 cited

BAR: Blockwise Adaptive Recoding for Batched Network Coding

Hoover H. F. Yin, Shenghao Yang, Qiaoqiao Zhou +2

Multi-hop networks become popular network topologies in various emerging Internet of things applications. Batched network coding (BNC) is a solution to reliable communications in s…

cs.IT2021★ 1 cited

On Achievable Rates of Line Networks with Generalized Batched Network Coding

Jie Wang, Shenghao Yang, Yanyan Dong +1

To better understand the wireless network design with a large number of hops, we investigate a line network formed by general discrete memoryless channels (DMCs), which may not be…

cs.IT2021

A Unified Adaptive Recoding Framework for Batched Network Coding

Hoover H. F. Yin, Bin Tang, Ka Hei Ng +3

Batched network coding is a variation of random linear network coding which has low computational and storage costs. In order to adapt to random fluctuations in the number of erasu…

cs.IT2021

Intrablock Interleaving for Batched Network Coding with Blockwise Adaptive Recoding

Hoover H. F. Yin, Ka Hei Ng, Allen Z. Zhong +3

Batched network coding (BNC) is a low-complexity solution to network transmission in multi-hop packet networks with packet loss. BNC encodes the source data into batches of packets…

cs.IT2021★ 1 cited

Utility Maximization for Multihop Wireless Networks Employing BATS Codes

Yanyan Dong, Sheng Jin, Yanzuo Chen +2

BATS (BATched Sparse) codes are a class of efficient random linear network coding variation that has been studied for multihop wireless networks mostly in scenarios of a single com…

cs.IT2020

On Optimal Finite-length Block Codes of Size Four for Binary Symmetric Channels

Yanyan Dong, Shenghao Yang

A binary code of blocklength and codebook size is called an code, which is studied for memoryless binary symmetric channels (BSCs) with the maximum likelihood (ML)…

cs.IT2020

Upper Bound Scalability on Achievable Rates of Batched Codes for Line Networks

Shenghao Yang, Jie Wang

The capacity of line networks with buffer size constraints is an open, but practically important problem. In this paper, the upper bound on the achievable rate of a class of codes,…

cs.IT2019

Decoding and Repair Schemes for Shift-XOR Regenerating Codes

Ximing Fu, Shenghao Yang, Zhiqing Xiao

Decoding and repair schemes are proposed for shift-exclusive-or (shift-XOR) product-matrix (PM) regenerating codes, which outperform the existing schemes in terms of both communica…

cs.IT2017★ 1 cited

Improved Upper Bound on the Network Function Computing Capacity

Xuan Guang, Raymond W. Yeung, Shenghao Yang +1

The problem of network function computation over a directed acyclic network is investigated in this paper. In such a network, a sink node desires to compute with zero error a {\em…

cs.IT2017★ 3 cited

Practical Inner Codes for Batched Sparse Codes in Wireless Multihop Networks

Zhiheng Zhou, Congduan Li, Shenghao Yang +1

Batched sparse (BATS) code is a promising technology for reliable data transmission in multi-hop wireless networks. As a BATS code consists of an outer code and an inner code that…

quant-ph2015★ 2 cited

Tight Bound on Randomness for Violating the CHSH Inequality

Yifeng Teng, Shenghao Yang, Siwei Wang +1

Free will (or randomness) has been studied to achieve loophole-free Bell's inequality test and to provide device-independent quantum key distribution security proofs. The required…

cs.IT2015★ 1 cited

Coding for Network-Coded Slotted ALOHA

Shenghao Yang, Yi Chen, Soung Chang Liew +1

Slotted ALOHA can benefit from physical-layer network coding (PNC) by decoding one or multiple linear combinations of the packets simultaneously transmitted in a timeslot, forming…

cs.IT2015

Comments on Cut-Set Bounds on Network Function Computation

Cupjin Huang, Zihan Tan, Shenghao Yang +1

A function computation problem in directed acyclic networks has been considered in the literature, where a sink node wants to compute a target function with the inputs generated at…

cs.IT2014★ 1 cited

Linearly-Coupled Fountain Codes

Shenghao Yang, Soung Chang Liew, Lizhao You +1

Network-coded multiple access (NCMA) is a communication scheme for wireless multiple-access networks where physical-layer network coding (PNC) is employed. In NCMA, a user encodes…

cs.IT2013★ 13 cited

Finite-Length Analysis of BATS Codes

Shenghao Yang, Tsz-Ching Ng, Raymond W. Yeung

BATS codes were proposed for communication through networks with packet loss. A BATS code consists of an outer code and an inner code. The outer code is a matrix generation of a fo…

cs.IT2013★ 3 cited

Expander Chunked Codes

Bin Tang, Shenghao Yang, Baoliu Ye +2

Chunked codes are efficient random linear network coding (RLNC) schemes with low computational cost, where the input packets are encoded into small chunks (i.e., subsets of the cod…

cs.IT2012★ 146 cited

Batched Sparse Codes

Shenghao Yang, Raymond W. Yeung

Network coding can significantly improve the transmission rate of communication networks with packet loss compared with routing. However, using network coding usually incurs high c…

cs.IT2011★ 1 cited

Capacity Analysis of Linear Operator Channels over Finite Fields

Shenghao Yang, Siu-Wai Ho, Jin Meng +1

Motivated by communication through a network employing linear network coding, capacities of linear operator channels (LOCs) with arbitrarily distributed transfer matrices over fini…