G. Ramalingam
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
G. Ramalingam
Theoretical Computer Science
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003
Yao Qi, Raja Das, et al.
ISSTA 2009
Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science