Statistical properties of selected recording codes
IBM Journal of Research and Development
On the Lovász Number of Certain Circulant Graphs
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Algorithmic and explicit determination of the Lovász number for certain circulant graphs
Discrete Applied Mathematics
Efficient computation of the lovász theta function for a class of circulant graphs
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
| Hi-index | 754.84 |
It is proven that 100-percent efficient fixed-rate codes for run-length-limited (RLL)(d,k)and RLL charge-constrained(d, k; c)channels are possible in only two eases, 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 leq d < k. For RLL charge-constrained systems with parameters(d, k;c), the binary capacity is irrational for all values of(d, k; c),0 leq d < k,2c geq k + 1, except(0,1; 1)and(1,3;3), which both have binary capacity1/2.