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

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

Published:1967-05 Issue:5 Volume:10 Page:522-552
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

Reference27 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. Stat.,1952

5. Optimal binary codes for small rates of transmission of information;Dobrushin;Theory of Probability and its Applications,1962

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

1. An Upper Bound on the Reliability Function of Discrete Memoryless Channels;IEEE Transactions on Information Theory;2024-05

2. 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

3. 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

4. Upper Bounds on the Mismatched Reliability Function and Capacity Using a Genie Receiver;IEEE Transactions on Information Theory;2023-07

5. Multi-Bit Relaying Over a Tandem of Channels;IEEE Transactions on Information Theory;2023-06