I T ] 1 7 A pr 2 01 8 The Sphere Packing Bound For Memoryless Channels

  title={I T ] 1 7 A pr 2 01 8 The Sphere Packing Bound For Memoryless Channels},
  author={Barış Nakiboğlu},
  • Barış Nakiboğlu
  • Published 2018
Sphere packing bounds (SPBs) —with prefactors that are polynomial in the block length— are derived for codes on two families of memoryless channels using Augustin’s method: (possibly non-stationary) memoryless channels with (possibly multiple) additive cost constraints and stationary memoryless channels with convex constraints on the composition (i.e. empirical distribution, type) of the input codewords. A variant of Gallager’s inner bound is derived in order to show that these sphere packing… CONTINUE READING

From This Paper

Topics from this paper.
0 Citations
39 References
Similar Papers


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

Error bounds for gaussian noise channels

  • P. M. Ebert
  • Quarterly Progress Report,
  • 1965
Highly Influential
10 Excerpts

Estimates of the error probability exponent for a semicontinuous memoryless channel

  • E. A. Haroutunian
  • Problems of Information Transmission,
  • 1968
Highly Influential
8 Excerpts

On the sphere-packing bound, capacity, and similar results for Poisson channels

  • M. V. Burnashev, Yu. A. Kutoyants
  • Problems of Information Transmission,
  • 1999
Highly Influential
7 Excerpts

Poltyrev. Random coding bounds for discrete memoryless channels

  • G. Sh
  • Problems of Information Transmission,
  • 1982
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…