• Publications
  • Influence
Batched Sparse Codes
TLDR
This paper introduces batched sparse code (BATS code), which enables a digital fountain approach to resolve the above issue of high computational and storage costs in the network devices and terminals. Expand
Refined Coding Bounds and Code Constructions for Coherent Network Error Correction
TLDR
This work obtains refined versions of the Hamming bound, the Singleton bound, and the Gilbert-Varshamov bound for coherent network error correction, which is tight for linear network codes. Expand
Linear Operator Channels over Finite Fields
Construction of Linear Network Codes that Achieve a Refined Singleton Bound
TLDR
A refined version of the Singleton bound for network error correction is presented, and an algorithm for constructing network codes that achieve this bound is proposed. Expand
Coding for a network coded fountain
TLDR
It is verified theoretically for certain cases and demonstrated numerically for the general cases that BATS codes achieve rates very close to the capacity of linear operator channels. Expand
Characterizations of Network Error Correction / Detection and Erasure Correction
In classical algebraic coding theory, the minimum distance of block code completely determines the ability of the code in terms of error correction/detection and erasure correction. We have obtainedExpand
Refined Coding Bounds for Network Error Correction
  • Shenghao Yang, R. Yeung
  • Mathematics, Computer Science
  • IEEE Information Theory Workshop on Information…
  • 1 July 2007
With respect to a given set of local encoding kernels defining a linear network code, refined versions of the Hamming bound, the Singleton bound and the Gilbert-Varshamov bound for network errorExpand
Finite-length analysis of BATS codes
TLDR
In this paper, performance of finite-length batched sparse (BATS) codes with belief propagation (BP) decoding is analyzed and a recursive formula is obtained to calculate the exact probability distribution of the stopping time of the BP decoder. Expand
Finite-length analysis of BATS codes
TLDR
In this paper, performance of finite-length batched sparse (BATS) codes with belief propagation (BP) decoding is analyzed and a recursive formula is obtained to calculate the exact probability distribution of the stopping time of the BP decoder. Expand
Overhead-Free In-Place Recovery Scheme for XOR-Based Storage Codes
TLDR
A novel recovery scheme for the XOR-based storage codes with the increasing-difference property, and an in-place decoding algorithm that acquires less auxiliary space than the existing decoding algorithm. Expand
...
1
2
3
4
5
...