z-logo
open-access-imgOpen Access
A class of generalized Shannon-McMillan theorems for arbitrary discrete information source
Author(s) -
Kangkang Wang
Publication year - 2011
Publication title -
turkish journal of mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.454
H-Index - 27
eISSN - 1303-6149
pISSN - 1300-0098
DOI - 10.3906/mat-0903-3
Subject(s) - mathematics , information source (mathematics) , class (philosophy) , entropy (arrow of time) , joint probability distribution , shannon's source coding theorem , information theory , kullback–leibler divergence , markov chain , limit (mathematics) , markov process , discrete mathematics , principle of maximum entropy , mathematical analysis , statistics , binary entropy function , computer science , maximum entropy thermodynamics , physics , quantum mechanics , artificial intelligence

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom