Entropy and Channel Capacity in the Regenerative Setup with Applications to Markov Channels

@inproceedings{Sharma2001EntropyAC,
  title={Entropy and Channel Capacity in the Regenerative Setup with Applications to Markov Channels},
  author={Vinod Sharma and Sandeep Kumar Singh},
  year={2001}
}
We obtainnew entropy andmutualinformationformulaefor regenerati ve stochasticprocesses.Our formulaereduceto thewell know formulaein thespecialcaseof Markov chains. WeusetheseformulaeonMarkov channelsandgeneralizetheresultsin GoldsmithandVaraiya [4]. As aresultweobtaincomputationallybetteralgorithmsto obtaintighterlowerboundsfor thesechannels.Finally we illustratewith anexample. 
Highly Cited
This paper has 163 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

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

Bounds on Channel Capacity of a Fiber Optic Channel with Memory

2018 Information Theory and Applications Workshop (ITA) • 2018

Estimating the information rate of a channel with classical input and output and a quantum state

2017 IEEE International Symposium on Information Theory (ISIT) • 2017
View 1 Excerpt

A Randomized Algorithm for the Capacity of Finite-State Channels

IEEE Transactions on Information Theory • 2015
View 2 Excerpts

On-Off Keying Communication Over Optical Channels With Crosstalk

IEEE Journal on Selected Areas in Communications • 2015
View 1 Excerpt

Accessible Capacity of Secondary Users

IEEE Transactions on Information Theory • 2014

164 Citations

01020'01'04'08'12'16
Citations per Year
Semantic Scholar estimates that this publication has 164 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…