Explicit rateless codes for memoryless binary-input output-symmetric channels
DOI10.4086/TOC.2018.V014A004zbMATH Open1395.94229OpenAlexW2883948815MaRDI QIDQ4568110FDOQ4568110
Authors: Benny Applebaum, Liron David, Guy Even 
Publication date: 15 June 2018
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2018.v014a004
Recommendations
error correcting codescoding theoryGaussian channelbinary symmetric channelrateless codesmemoryless binary-input output symmetric channel
Coding theorems (Shannon theory) (94A24) Linear codes (general theory) (94B05) Channel models (including quantum) in information and communication theory (94A40)
Cites Work
- Error Exponents of Expander Codes under Linear-Complexity Decoding
- Error exponents of expander codes
- Linear-time encodable and decodable error-correcting codes
- Raptor codes
- Linear-Time Encodable/Decodable Codes With Near-Optimal Rate
- Random codes: minimum distances and error exponents
- Bounds on the decoding error probability of binary linear codes via their spectra
- An adaptive-feedback coding scheme using incremental redundancy (Corresp.)
- Rate-Compatible Puncturing of Low-Density Parity-Check Codes
- Random coding techniques for nonrandom codes
- Deterministic rateless codes for BSC
- 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)
