Lower bounds to error probability for coding on discrete memoryless channels. I-Reference-Cited by-同舟云学术

Lower bounds to error probability for coding on discrete memoryless channels. I

Published:1967-01 Issue:1 Volume:10 Page:65-103
ISSN:0019-9958
Container-title:Information and Control
language:en
Short-container-title:Information and Control

Author:

Shannon C.E.,Gallager R.G.,Berlekamp E.R.

Publisher

Elsevier BV

Subject

General Engineering

Reference26 articles.

1. Information Theory;Ash,1965

2. Block Coding with Noiseless Feedback;Berlekamp,1964

3. On a measure of divergence between two statistical populations defined by their probability distributions;Bhattacharyya;Bull. Calcutta Math. Soc.,1943

4. A measure of asymptotic efficiency for tests of an hypothesis based on the sum of observations;Chernoff;Ann. Math. Statist.,1952

5. List Decoding for Noisy Channels;Elias,1955

Cited by 264 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Multiple Packing: Lower Bounds via Error Exponents;IEEE Transactions on Information Theory;2024-02

2. Generalized Random Gilbert-Varshamov Codes: Typical Error Exponent and Concentration Properties;IEEE Transactions on Information Theory;2024-02

3. Concentration Properties of Random Codes;IEEE Transactions on Information Theory;2023-12

4. On the Optimal Delay Growth Rate of Multi-Hop Line Networks: Asymptotically Delay-Optimal Designs and the Corresponding Error Exponents;IEEE Transactions on Information Theory;2023-10

5. Derandomizing Codes for the Binary Adversarial Wiretap Channel of Type II;2023 59th Annual Allerton Conference on Communication, Control, and Computing (Allerton);2023-09-26