Abstract

Strong typicality, which is more powerful for theorem proving than the weak typicality, can be applied to finite alphabet only, while weak typicality can be applied to both finite and countably infinite alphabets. In this paper, the relation between typicality and information divergence measures is discussed. This leads to the definition of a unified typicality for finite or countably infinite alphabet which is stronger than both weak typicality and strong typicality

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.