Coding theorem for a generalized maximum likelihood decoding scheme
From MaRDI portal
Publication:1249554
zbMATH Open0385.94009MaRDI QIDQ1249554FDOQ1249554
Publication date: 1978
Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)
Recommendations
- A coding theorem for multiple access channels using a maximum likelihood list decoding scheme
- Certain generalizations of concatenated codes--Exponential error bounds and decoding complexity
- Distance Distribution of Binary Codes and the Error Probability of Decoding
- New upper bounds on error exponents
- Decoding by local optimization (Corresp.)
Cited In (5)
- Coding theorem for partial received information
- Nonparametric threshold decision rule, coverings, and some consequences
- Exponential error bounds for an erasure scheme for partial received information
- The Generalized Stochastic Likelihood Decoder: Random Coding and Expurgated Bounds
- Coding Theorems on the Threshold Scheme for a General Source
This page was built for publication: Coding theorem for a generalized maximum likelihood decoding scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1249554)