Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science
It is proven that 100-percent efficient fixed-rate codes for runlength-limited (RLL) (d, k) and RLL charge-constrained (d, k; c) channels are possible in only two cases, namely (d,k;c) = (0,1;1) and (1,3;3). Specifically, the binary Shannon capacity of RLL (d, k) constrained systems is shown to be irrational for all values of (d, k),0 ≤ d. < © 1987 IEEE
Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science
Joel L. Wolf, Mark S. Squillante, et al.
IEEE Transactions on Knowledge and Data Engineering
Leo Liberti, James Ostrowski
Journal of Global Optimization
David A. Selby
IBM J. Res. Dev