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

14 Jan 2020 Yang Shenghao Wang Jie

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, called batched codes, is studied for line networks... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • INFORMATION THEORY
  • INFORMATION THEORY