Bounds on the Size and Asymptotic Rate of Subblock-Constrained Codes
暂无分享,去创建一个
[1] Robert J. McEliece,et al. New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities , 1977, IEEE Trans. Inf. Theory.
[2] W. Rudin. Principles of mathematical analysis , 1964 .
[3] Jian Gu,et al. A generalized Gilbert-Varshamov bound derived via analysis of a code-search algorithm , 1993, IEEE Trans. Inf. Theory.
[4] Gérard D. Cohen,et al. On Bounded Weight Codes , 2010, IEEE Transactions on Information Theory.
[5] Mehul Motani,et al. Subblock energy-constrained codes for simultaneous energy and information transfer , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).
[6] Yeow Meng Chee,et al. Matrix codes and multitone frequency shift keying for power line communications , 2013, 2013 IEEE International Symposium on Information Theory.
[7] Selmer M. Johnson,et al. Upper bounds for constant weight error correcting codes , 1972, Discret. Math..
[8] R. Stanley. Log‐Concave and Unimodal Sequences in Algebra, Combinatorics, and Geometry a , 1989 .
[9] Ludo M. G. M. Tolhuizen,et al. The generalized Gilbert-Varshamov bound is implied by Turan's theorem [code construction] , 1997, IEEE Trans. Inf. Theory.
[10] Charles V. Freiman. Upper bounds for fixed-weight codes of specified minimum distance (Corresp.) , 1964, IEEE Trans. Inf. Theory.
[11] Mehul Motani,et al. Bounds on the asymptotic rate of binary constant subblock-composition codes , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).
[12] Xin Wang,et al. New Bounds and Constructions for Multiply Constant-Weight Codes , 2016, IEEE Transactions on Information Theory.
[13] Eitan Yaakobi,et al. Generalized Sphere Packing Bound , 2014, IEEE Transactions on Information Theory.
[14] Daniel Cullina,et al. Generalized Sphere-Packing Bounds on the Size of Codes for Combinatorial Channels , 2016, IEEE Transactions on Information Theory.
[15] Miklós Bóna,et al. Combinatorics of permutations , 2022, SIGA.
[16] Mehul Motani,et al. Binary subblock energy-constrained codes: Bounds on code size and asymptotic rate , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).
[17] Sylvain Guilley,et al. Multiply Constant-Weight Codes and the Reliability of Loop Physically Unclonable Functions , 2014, IEEE Transactions on Information Theory.
[18] Morris Plotkin,et al. Binary codes with specified minimum distance , 1960, IRE Trans. Inf. Theory.
[19] N. J. A. Sloane,et al. Lower bounds for constant weight codes , 1980, IEEE Trans. Inf. Theory.
[20] Mehul Motani,et al. Subblock-Constrained Codes for Real-Time Simultaneous Energy and Information Transfer , 2015, IEEE Transactions on Information Theory.
[21] N. J. A. Sloane,et al. Bounds for binary codes of length less than 25 , 1978, IEEE Trans. Inf. Theory.
[22] G. David Forney,et al. Concatenated codes , 2009, Scholarpedia.
[23] Gérard D. Cohen,et al. Heavy weight codes , 2010, 2010 IEEE International Symposium on Information Theory.
[24] Jochen Harant,et al. A lower bound on the independence number of a graph , 1998, Discret. Math..
[25] E. R. Berger. Some additional upper bounds for fixed-weight codes of specified minimum distance , 1967, IEEE Trans. Inf. Theory.
[26] Yeow Meng Chee,et al. Constructions of Optimal and Near-Optimal Multiply Constant-Weight Codes , 2017, IEEE Transactions on Information Theory.
[27] Selmer M. Johnson. A new upper bound for error-correcting codes , 1962, IRE Trans. Inf. Theory.
[28] D. A. Bell,et al. Information Theory and Reliable Communication , 1969 .