Please use this identifier to cite or link to this item: http://localhost/handle/Hannan/717003
Title: Universal Channel Coding for General Output Alphabet
Other Titles: IEEE Transactions on Information Theory
Authors: Masahito Hayashi
subject: information spectrum|Universal coding|Bayesian|method of types
Year: -1-Uns- -1
Abstract: We propose two classes of universal codes that are suited to two asymptotic regimes when the output alphabet is possibly continuous. The first class has the property that the error probability decays exponentially fast, and we identify an explicit lower bound on the error exponent. The other class attains the epsilon-capacity of the channel, and we also identify the second-order term in the asymptotic expansion. The proposed encoder is essentially based on the packing lemma of the method of types. For the decoder, we first derive a Rényi-relative-entropy version of Clarke and Barron's formula the distance between the true distribution and the Bayesian mixture, which is of independent interest. The universal decoder is stated in terms of this formula and quantities used in the information spectrum method. The methods contained herein allow us to analyze universal codes for channels with continuous and discrete output alphabets in a unified manner and to analyze their performances in terms of the exponential decay of the error probability and the second-order coding rate.
URI: http://localhost/handle/Hannan/717003
ISBN: 0018-9448
volume: Volume
issue: Issue
Appears in Collections:New Ieee 2019

Files in This Item:
File Description SizeFormat 
08502882.pdf471.63 kBAdobe PDFThumbnail
Preview File
Title: Universal Channel Coding for General Output Alphabet
Other Titles: IEEE Transactions on Information Theory
Authors: Masahito Hayashi
subject: information spectrum|Universal coding|Bayesian|method of types
Year: -1-Uns- -1
Abstract: We propose two classes of universal codes that are suited to two asymptotic regimes when the output alphabet is possibly continuous. The first class has the property that the error probability decays exponentially fast, and we identify an explicit lower bound on the error exponent. The other class attains the epsilon-capacity of the channel, and we also identify the second-order term in the asymptotic expansion. The proposed encoder is essentially based on the packing lemma of the method of types. For the decoder, we first derive a Rényi-relative-entropy version of Clarke and Barron's formula the distance between the true distribution and the Bayesian mixture, which is of independent interest. The universal decoder is stated in terms of this formula and quantities used in the information spectrum method. The methods contained herein allow us to analyze universal codes for channels with continuous and discrete output alphabets in a unified manner and to analyze their performances in terms of the exponential decay of the error probability and the second-order coding rate.
URI: http://localhost/handle/Hannan/717003
ISBN: 0018-9448
volume: Volume
issue: Issue
Appears in Collections:New Ieee 2019

Files in This Item:
File Description SizeFormat 
08502882.pdf471.63 kBAdobe PDFThumbnail
Preview File
Title: Universal Channel Coding for General Output Alphabet
Other Titles: IEEE Transactions on Information Theory
Authors: Masahito Hayashi
subject: information spectrum|Universal coding|Bayesian|method of types
Year: -1-Uns- -1
Abstract: We propose two classes of universal codes that are suited to two asymptotic regimes when the output alphabet is possibly continuous. The first class has the property that the error probability decays exponentially fast, and we identify an explicit lower bound on the error exponent. The other class attains the epsilon-capacity of the channel, and we also identify the second-order term in the asymptotic expansion. The proposed encoder is essentially based on the packing lemma of the method of types. For the decoder, we first derive a Rényi-relative-entropy version of Clarke and Barron's formula the distance between the true distribution and the Bayesian mixture, which is of independent interest. The universal decoder is stated in terms of this formula and quantities used in the information spectrum method. The methods contained herein allow us to analyze universal codes for channels with continuous and discrete output alphabets in a unified manner and to analyze their performances in terms of the exponential decay of the error probability and the second-order coding rate.
URI: http://localhost/handle/Hannan/717003
ISBN: 0018-9448
volume: Volume
issue: Issue
Appears in Collections:New Ieee 2019

Files in This Item:
File Description SizeFormat 
08502882.pdf471.63 kBAdobe PDFThumbnail
Preview File