A general formula for channel capacity

@article{Verd1994AGF,
  title={A general formula for channel capacity},
  author={Sergio Verd{\'u} and Te Sun Han},
  journal={IEEE Trans. Information Theory},
  year={1994},
  volume={40},
  pages={1147-1157}
}
Abrlracr-A h u l a for the cppecity et arbitrary sbgle-wer chrurwla without feedback (mot neccgdueily Wium" stable, stationary, etc.) is proved. Capacity ie shown to e i p l the supremum, over all input processts, & the input-outpat infiqjknda QBnd as the llnainl ia praabiutJr d the normalized information density. The key to thir zbllljt is a ntw a"c sppmrh bosed 811 a Ampie II(A Lenar trwrd eu the pralwbility of m-4v hgpothesb t#tcl UIOlls eq*rdIaN <hypotheses. A neassruy and d c i e n t… CONTINUE READING
Highly Influential
This paper has highly influenced 94 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 860 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 487 extracted citations

861 Citations

020406080'95'00'06'12'18
Citations per Year
Semantic Scholar estimates that this publication has 861 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 21 references

The coding of messages subject to chance errors

  • J. Wolfowitz
  • 1995

The joint sourcechannel separation theorem revisited

  • S. VerdG S. Vembu, Y. Steinberg
  • IEEE Trans . Inform . ’ Theory
  • 1995

Asymptotic Mcrhods m Statistical Deckion Theory

  • 1954. L. Le Cam
  • New York Springer,
  • 1986

Komer, Information Theory: Coding T h e o m for Discrete Memorykss Systems

  • York Springer, J. 1978. I. C s i d r
  • New York Academic,
  • 1981

The capacitv of a discrete channel

  • I. Nedoma
  • Proc . 1 st Prague Conf . Inform . ‘ The…
  • 1977

Cover , “ Broadcast channels

  • M. T.
  • IEEE Trans . Znfonn . Theory
  • 1972

Similar Papers

Loading similar papers…