Can Basic ML Techniques Illuminate Rateless Erasure Codes?
The recently developed rateless erasure codes are a near-optimal channel coding technique that guaranteeslow overhead and fast decoding. The underlying theory, and current implementations, of thesecodes assume that a network transmitter encodes according to a pre-specified probability distribution.I...
Main Authors: | Gupta, Anjali, Krohn, Maxwell, Walfish, Michael |
---|---|
Other Authors: | Parallel and Distributed Operating Systems |
Language: | en_US |
Published: |
2005
|
Online Access: | http://hdl.handle.net/1721.1/30467 |
Similar Items
-
Rateless spinal codes
by: Perry, Jonathan, et al.
Published: (2013) -
Rateless and rateless unequal error protection codes for Gaussian channels
by: Boyle, Kevin P. (Kevin Patrick)
Published: (2008) -
Rateless Coding for Gaussian Channels
by: Erez, Uri, et al.
Published: (2012) -
Fulcrum Rateless Multicast Distributed Coding Design
by: Yair Rivera Julio, et al.
Published: (2023-01-01) -
Rateless Protograph LDPC Codes for Quantum Key Distribution
by: Alberto Tarable, et al.
Published: (2024-01-01)