Improved Asymptotic Sphere-Packing Bounds for Subblock-Constrained Codes
暂无分享,去创建一个
[1] Sylvain Guilley,et al. Multiply Constant-Weight Codes and the Reliability of Loop Physically Unclonable Functions , 2014, IEEE Transactions on Information Theory.
[2] Mehul Motani,et al. Bounds on the asymptotic rate of binary constant subblock-composition codes , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).
[3] Eitan Yaakobi,et al. Generalized Sphere Packing Bound , 2014, IEEE Transactions on Information Theory.
[4] Ankur A. Kulkarni,et al. Nonasymptotic Upper Bounds for Deletion Correcting Codes , 2012, IEEE Transactions on Information Theory.
[5] Mehul Motani,et al. Subblock-Constrained Codes for Real-Time Simultaneous Energy and Information Transfer , 2015, IEEE Transactions on Information Theory.
[6] Shancheng Zhao,et al. A Serial Concatenation-Based Coding Scheme for Dimmable Visible Light Communication Systems , 2016, IEEE Communications Letters.
[7] Mehul Motani,et al. Bounds on the Size and Asymptotic Rate of Subblock-Constrained Codes , 2018, IEEE Transactions on Information Theory.
[8] Mehul Motani,et al. Subblock energy-constrained codes for simultaneous energy and information transfer , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).
[9] Yeow Meng Chee,et al. Matrix codes and multitone frequency shift keying for power line communications , 2013, 2013 IEEE International Symposium on Information Theory.
[10] E. R. Berger. Some additional upper bounds for fixed-weight codes of specified minimum distance , 1967, IEEE Trans. Inf. Theory.
[11] Charles V. Freiman. Upper bounds for fixed-weight codes of specified minimum distance (Corresp.) , 1964, IEEE Trans. Inf. Theory.
[12] Mehul Motani,et al. Real-time simultaneous energy and information transfer , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).