Conference paper
A privacy-protecting coupon system
Liqun Chen, Matthias Enzmann, et al.
FC 2005
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
Liqun Chen, Matthias Enzmann, et al.
FC 2005
S.M. Sadjadi, S. Chen, et al.
TAPIA 2009
Robert C. Durbeck
IEEE TACON
Alfonso P. Cardenas, Larry F. Bowman, et al.
ACM Annual Conference 1975