2021/05/02 by Gerhard Kramer, Kramer, Gerhard
Computer Science · Mathematics · #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.2105.00406
2021 IEEE International Symposium on Information Theory
arxiv created 2021/05/02 · arxiv updated 2021/05/04
Distribution matchers for finite alphabets are shown to have informational divergences that grow logarithmically with the block length, generalizing a basic result for binary strings.