Statistical properties of selected recording codes
IBM Journal of Research and Development
On the distribution of runs of ones in binary strings
Computers & Mathematics with Applications
Reliable communication in the absence of a common clock
IEEE Transactions on Information Theory
Coded modulation with a constraint on the minimum channel symbol duration
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
ACM Transactions on Algorithms (TALG)
Noisy constrained capacity for BSC channels
IEEE Transactions on Information Theory
Designing efficient codes for synchronization error channels
Proceedings of the Nineteenth International Workshop on Quality of Service
| Hi-index | 754.97 |
Several results on binary (d, k) codes are given. First, a novel derivation for the capacity of these codes based on information-theoretic principles is given. Based on this result the spectrum of a (d, k) code is computed. Finally, the problem of computing the capacity of the binary symmetric channel under the condition that the input sequences satisfy the (d, k ) constraint is considered. Lower bounds on the capacity of such a channel are derived