Distribution matchers for finite alphabets are shown to have informationaldivergences that grow logarithmically with the block length . This is a generalizing abasic result for binary strings .

Author(s) : Gerhard Kramer

Links : PDF - Abstract

Code :
Coursera

Keywords : distribution - - scaling - divergence - strings -

Leave a Reply

Your email address will not be published. Required fields are marked *