Coding theorem for a generalized maximum likelihood decoding scheme

zbMATH Open0385.94009MaRDI QIDQ1249554FDOQ1249554

Authors Neelam Raina, Bhudev Sharma

Publication date 1978

Published in Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Decoding (94B35)

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 Theorems on the Threshold Scheme for a General Source
• The Generalized Stochastic Likelihood Decoder: Random Coding and Expurgated Bounds
• Coding theorem for partial received information
• Exponential error bounds for an erasure scheme for partial received information
• Nonparametric threshold decision rule, coverings, and some consequences

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)