Explicit rateless codes for memoryless binary-input output-symmetric channels
From MaRDI portal
Publication:4568110
Recommendations
Cites work
- An adaptive-feedback coding scheme using incremental redundancy (Corresp.)
- Bounds on the decoding error probability of binary linear codes via their spectra
- Deterministic rateless codes for BSC
- Error Exponents of Expander Codes under Linear-Complexity Decoding
- Error exponents of expander codes
- Linear-Time Encodable/Decodable Codes With Near-Optimal Rate
- Linear-time encodable and decodable error-correcting codes
- Random codes: minimum distances and error exponents
- Random coding techniques for nonrandom codes
- Raptor codes
- Rate-Compatible Puncturing of Low-Density Parity-Check Codes
- Rateless Coding for Gaussian Channels
- The throughput of hybrid-ARQ protocols for the Gaussian collision channel
Cited in
(3)
This page was built for publication: Explicit rateless codes for memoryless binary-input output-symmetric channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4568110)