CONTRIBUTION OF CHANNEL EQUIVOCATION FOR THE DEVELOPMENT OF SOURCE CODING THEOREMS

@article{Parkash2014CONTRIBUTIONOC,
  title={CONTRIBUTION OF CHANNEL EQUIVOCATION FOR THE DEVELOPMENT OF SOURCE CODING THEOREMS},
  author={O. Parkash and Priyanka Kakkar},
  journal={International journal of pure and applied mathematics},
  year={2014},
  volume={96},
  pages={307-322}
}
The present communication deals with the development of new coding theorems in terms of channel equivocation, that is, coding is done for a source which selects a new set of source statistics after each output symbol is received from the channel. New proof for Fano's bound on Shannon's equiv- ocation is provided by using log sum inequality. Moreover, bounds on various generalizations of Shannon's equivocation have been provided. 

Tables from this paper

References

SHOWING 1-10 OF 19 REFERENCES
A Mathematical Theory of Communication
A Coding Theorem and Rényi's Entropy
  • L. Campbell
  • Mathematics, Computer Science
  • Inf. Control.
  • 1965
Development of two new mean codeword lengths
On the Interplay Between Conditional Entropy and Error Probability
A New Approach of Deriving Bounds between Entropy and Error from Joint Distribution: Case Study for Binary Classifications
Entropy measures and unconditional security in cryptography
Information Theory and Coding
Entropy and Coding
...
1
2
...