Oliver Bodemer
IBM J. Res. Dev
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
Oliver Bodemer
IBM J. Res. Dev
Maciel Zortea, Miguel Paredes, et al.
IGARSS 2021
Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science
Maurice Hanan, Peter K. Wolff, et al.
DAC 1976