Information Theory and Reliable Communication
Information Theory and Reliable Communication
IEEE Transactions on Information Theory
The information-theoretic capacity of discrete-time queues
IEEE Transactions on Information Theory
Sequential decoding for the exponential server timing channel
IEEE Transactions on Information Theory
Codes on graphs: normal realizations
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Nested linear/lattice codes for structured multiterminal binning
IEEE Transactions on Information Theory
Entropy and the timing capacity of discrete queues
IEEE Transactions on Information Theory
Achieving 1/2 log (1+SNR) on the AWGN channel with lattice encoding and decoding
IEEE Transactions on Information Theory
Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels
IEEE Transactions on Information Theory
Nonparametric belief propagation for self-localization of sensor networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
This paper discusses practical codes for communication via packet timings across network queuing systems - an instantiation of the "Bits Through Queues" result for timing channels. It has recently been shown that sparse-graph linear codes followed by shaping techniques, combined with message-passing decoding, can enable practical timing channel codes with low symbol error rates near the capacity. The previous work had two main drawbacks. First, the shaping technique was only effective for very large finite field sizes. Secondly, the complexity of the message-passing decoder was quadratic in the block length. In this work, 1) we develop an alternative shaping technique using random dithers with provably good statistical guarantees; 2) we exploit Little's Law from queuing theory along with a large deviations argument to reduce the message-passing decoder's complexity from quadratic to linear in block length. We illustrate the effectiveness of this approach on simulated queuing systems with low symbol error rates near the capacity.