Please use this identifier to cite or link to this item: http://localhost/handle/Hannan/717003
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMasahito Hayashien_US
dc.date.accessioned2013en_US
dc.date.accessioned2021-05-16T17:43:35Z-
dc.date.available2021-05-16T17:43:35Z-
dc.date.issueden_US
dc.identifier.isbn0018-9448en_US
dc.identifier.other10.1109/TIT.2018.2877456en_US
dc.identifier.urihttp://localhost/handle/Hannan/717003-
dc.description.abstractWe 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.en_US
dc.relation.haspart08502882.pdfen_US
dc.subjectinformation spectrum|Universal coding|Bayesian|method of typesen_US
dc.titleUniversal Channel Coding for General Output Alphabeten_US
dc.title.alternativeIEEE Transactions on Information Theoryen_US
dc.typeArticleen_US
dc.journal.volumeVolumeen_US
dc.journal.issueIssueen_US
dc.journal.titleIEEE Transactions on Information Theoryen_US
Appears in Collections:New Ieee 2019

Files in This Item:
File Description SizeFormat 
08502882.pdf471.63 kBAdobe PDFThumbnail
Preview File
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMasahito Hayashien_US
dc.date.accessioned2013en_US
dc.date.accessioned2021-05-16T17:43:35Z-
dc.date.available2021-05-16T17:43:35Z-
dc.date.issueden_US
dc.identifier.isbn0018-9448en_US
dc.identifier.other10.1109/TIT.2018.2877456en_US
dc.identifier.urihttp://localhost/handle/Hannan/717003-
dc.description.abstractWe 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.en_US
dc.relation.haspart08502882.pdfen_US
dc.subjectinformation spectrum|Universal coding|Bayesian|method of typesen_US
dc.titleUniversal Channel Coding for General Output Alphabeten_US
dc.title.alternativeIEEE Transactions on Information Theoryen_US
dc.typeArticleen_US
dc.journal.volumeVolumeen_US
dc.journal.issueIssueen_US
dc.journal.titleIEEE Transactions on Information Theoryen_US
Appears in Collections:New Ieee 2019

Files in This Item:
File Description SizeFormat 
08502882.pdf471.63 kBAdobe PDFThumbnail
Preview File
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMasahito Hayashien_US
dc.date.accessioned2013en_US
dc.date.accessioned2021-05-16T17:43:35Z-
dc.date.available2021-05-16T17:43:35Z-
dc.date.issueden_US
dc.identifier.isbn0018-9448en_US
dc.identifier.other10.1109/TIT.2018.2877456en_US
dc.identifier.urihttp://localhost/handle/Hannan/717003-
dc.description.abstractWe 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.en_US
dc.relation.haspart08502882.pdfen_US
dc.subjectinformation spectrum|Universal coding|Bayesian|method of typesen_US
dc.titleUniversal Channel Coding for General Output Alphabeten_US
dc.title.alternativeIEEE Transactions on Information Theoryen_US
dc.typeArticleen_US
dc.journal.volumeVolumeen_US
dc.journal.issueIssueen_US
dc.journal.titleIEEE Transactions on Information Theoryen_US
Appears in Collections:New Ieee 2019

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