Abstract
Batched sparse (BATS) codes have been proposed for communication through networks with packet loss. BATS codes include a matrix generalization of fountain codes as the outer code and random linear network coding at the intermediate network nodes as the inner code. BATS codes, however, do not possess a universal degree distribution that achieves an optimal rate for any distribution of the transfer matrix ranks. Therefore, it is important to have a fast degree-distribution optimization approach for finite-length BATS codes. In this paper, we propose the concept of batch release probability (BRP), and demonstrate some characteristics of BRPs from the degree distributions achieving nearly optimal performance. Based on these BRP characteristics, we propose a novel degree-distribution optimization approach that achieves the similar decoding performance with a much shorter optimization time, compared with the previous approach. Moreover, the universality of BRPs observed in this paper can further simplify the degree-distribution optimization of BATS codes.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Yang S H, Yeung R W. Coding for a network coded fountain. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), Saint-Petersburg, 2011. 2647–2651
Yang S H, Yeung R W. Batched sparse codes. IEEE Trans Inf Theory, 2014, 60: 5322–5346
Luby M. LT codes. In: Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, Los Alamitos, 2002. 271–280
Shokrollahi A. Raptor codes. IEEE/ACM Trans Netw, 2006, 14: 2551–2567
Li S-Y R, Yeung R W, Cai N. Linear network coding. IEEE Trans Inf Theory, 2003, 49: 371–381
Ho T, Medard M, Koetter R, et al. A random linear network coding approach to multicast. IEEE Trans Inf Theory, 2006, 52: 4413–4430
Tang B, Yang S, Ye B, et al. Expander chunked codes. Eurasip J Adv Signal Process, 2015, 2015: 1–13
Mahdaviani K, Ardakani M, Bagheri H, et al. Gamma codes: a low-overhead linear-complexity network coding solution. In: Proceedings of International Symposium on Network Coding, Cambridge, 2012. 125–130
Yang S, Tang B. From LDPC to chunked network codes. In: Proceedings of IEEE Information Theory Workshop, Hobart, 2014. 406–410
Huang Q, Sun K, Li X, et al. Just FUN: a joint fountain coding and network coding approach to loss-tolerant information spreading. In: Proceedings of the 15th ACM International Symposium on Mobile Ad Hoc Networking and Computing, Philadelphia, 2014. 83–92
Xu X, Praveen Kumar M S G, Guan Y L, et al. Two-phase cooperative broadcasting based on batched network code. IEEE Trans Commun, 2016, 64: 706–714
Xu X, Guan Y L. Reliable broadcast to a user group with limited source transmissions. In: Proceedings of IEEE International Conference on Communications, London, 2015
Yang S, Yeung R W, Cheung J H F, et al. BATS: network coding in action. In: Proceedings of the 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2015. 1204–1211
Yang S, Ng T C, Yeung R W. Finite-length analysis of BATS codes. In: Proceedings of International Symposium on Network Coding (NetCod), Calgary, 2013
Smith N A, Tromble R W. Sampling uniformly from the unit simplex. Johns Hopkins University, Tech. Rep, 2004. http://www.cs.cmu.edu/~nasmith/papers/smith+tromble.tr04.pdf
Acknowledgements
This work was supported by Delay/Disruption Tolerant Communication Technology of the Chinese Academy of Sciences (Grant No. 2015AA703405A), and National Natural Science Foundation of China (Grant No. 61471215).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhao, H., Yang, S. & Feng, G. Fast degree-distribution optimization for BATS codes. Sci. China Inf. Sci. 60, 102301 (2017). https://doi.org/10.1007/s11432-016-9011-8
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s11432-016-9011-8