Bounds on the asymptotic rate of binary constant subblock-composition codes
暂无分享,去创建一个
[1] Xin Wang,et al. New Bounds and Constructions for Multiply Constant-Weight Codes , 2016, IEEE Transactions on Information Theory.
[2] R. Stanley. Log‐Concave and Unimodal Sequences in Algebra, Combinatorics, and Geometry a , 1989 .
[3] Yeow Meng Chee,et al. Constructions of Optimal and Near-Optimal Multiply Constant-Weight Codes , 2017, IEEE Transactions on Information Theory.
[4] Mehul Motani,et al. Subblock-Constrained Codes for Real-Time Simultaneous Energy and Information Transfer , 2015, IEEE Transactions on Information Theory.
[5] Mehul Motani,et al. Bounds on the Size and Asymptotic Rate of Subblock-Constrained Codes , 2018, IEEE Transactions on Information Theory.
[6] Robert J. McEliece,et al. New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities , 1977, IEEE Trans. Inf. Theory.
[7] Sylvain Guilley,et al. Multiply Constant-Weight Codes and the Reliability of Loop Physically Unclonable Functions , 2014, IEEE Transactions on Information Theory.
[8] Morris Plotkin,et al. Binary codes with specified minimum distance , 1960, IRE Trans. Inf. Theory.
[9] N. J. A. Sloane,et al. Lower bounds for constant weight codes , 1980, IEEE Trans. Inf. Theory.
[10] E. Gilbert. A comparison of signalling alphabets , 1952 .