A rate-adaptive MAC protocol for multi-Hop wireless networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Reed-Solomon Codes and Their Applications
Reed-Solomon Codes and Their Applications
Robust rate adaptation for 802.11 wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Efficient channel-aware rate adaptation in dynamic environments
Proceedings of the 6th international conference on Mobile systems, applications, and services
The Salsa20 Family of Stream Ciphers
New Stream Cipher Designs
Cross-layer wireless bit rate adaptation
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Fast sequential decoding algorithm using a stack
IBM Journal of Research and Development
Predictable 802.11 packet delivery from wireless channel measurements
Proceedings of the ACM SIGCOMM 2010 conference
AccuRate: constellation based rate estimation in wireless networks
NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation
Global design methods for raptor codes using binary and higher-order modulations
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Airblue: a system for cross-layer wireless protocol development
Proceedings of the 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Strider: automatic rate adaptation and collision handling
Proceedings of the ACM SIGCOMM 2011 conference
Proceedings of the 10th ACM Workshop on Hot Topics in Networks
IEEE Transactions on Wireless Communications
Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
IEEE Transactions on Information Theory
Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
IEEE Transactions on Information Theory
Channel coding with multilevel/phase signals
IEEE Transactions on Information Theory
Rate-compatible puncturing of low-density parity-check codes
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
A comparison of reduced complexity decoding algorithms for trellis codes
IEEE Journal on Selected Areas in Communications
Rateless Coding for Gaussian Channels
IEEE Transactions on Information Theory
No symbol left behind: a link-layer protocol for rateless codes
Proceedings of the 18th annual international conference on Mobile computing and networking
No symbol left behind: a link-layer protocol for rateless codes
Proceedings of the 18th annual international conference on Mobile computing and networking
Power-aware rateless codes in mobile wireless communication
Proceedings of the 11th ACM Workshop on Hot Topics in Networks
Proceedings of the eighth ACM/IEEE symposium on Architectures for networking and communications systems
LEAD: leveraging protocol signatures for improving wireless link performance
Proceeding of the 11th annual international conference on Mobile systems, applications, and services
Hi-index | 0.00 |
Spinal codes are a new class of rateless codes that enable wireless networks to cope with time-varying channel conditions in a natural way, without requiring any explicit bit rate selection. The key idea in the code is the sequential application of a pseudo-random hash function to the message bits to produce a sequence of coded symbols for transmission. This encoding ensures that two input messages that differ in even one bit lead to very different coded sequences after the point at which they differ, providing good resilience to noise and bit errors. To decode spinal codes, this paper develops an approximate maximum-likelihood decoder, called the bubble decoder, which runs in time polynomial in the message size and achieves the Shannon capacity over both additive white Gaussian noise (AWGN) and binary symmetric channel (BSC) models. Experimental results obtained from a software implementation of a linear-time decoder show that spinal codes achieve higher throughput than fixed-rate LDPC codes, rateless Raptor codes, and the layered rateless coding approach of Strider, across a range of channel conditions and message sizes. An early hardware prototype that can decode at 10 Mbits/s in FPGA demonstrates that spinal codes are a practical construction.