On capacity-achieving sequences of degree distributions

Alon Orlitsky, Krishnamurthy Viswanathan, Junan Zhang

Research output: Contribution to journalConference article

1 Scopus citations

Abstract

A systematic study of capacity achieving sequences was addressed. It was shown that under certain constraints, one of which was necessary, the composition of degree distribution pairs of a capacity achieving sequence with a function from A, gives rise to another capacity achieving sequence. In addition, it was proved that the rates of convergence of these capacity achieving sequences remain unaffected, up to a multiplicative constant, under the same operation.

Original languageEnglish (US)
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
StatePublished - Oct 20 2003
EventProceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, Japan
Duration: Jun 29 2003Jul 4 2003

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Cite this