Coding theorem for partial received information
From MaRDI portal
Publication:1148289
DOI10.1016/0020-0255(80)90037-7zbMath0451.94003OpenAlexW2071260564MaRDI QIDQ1148289
Publication date: 1980
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0255(80)90037-7
Decoding (94B35) Error probability in coding theory (94B70) Coding theorems (Shannon theory) (94A24)
Related Items (3)
Exponential error bounds for an erasure scheme for partial received information ⋮ Some source coding theorems and 1:1 coding based on generalized inaccuracy measure of order \(\alpha \) and type \(\beta \) ⋮ Development of two new mean codeword lengths
Cites Work
- Unnamed Item
- Unnamed Item
- A coding theorem for multiple access channels using a maximum likelihood list decoding scheme
- Coding theorem for a generalized maximum likelihood decoding scheme
- Composition bounds for channel block codes
- A simple derivation of the coding theorem and some applications
- Exponential error bounds for discrete memoryless channels with sequential decision feedback
This page was built for publication: Coding theorem for partial received information