NDLI: Expurgated Random-Coding Ensembles: Exponents, Refinements, and Connections

Content Provider	IEEE Xplore Digital Library
Author	Scarlett, J. Li Peng Merhav, N. Martinez, A. Guillen i Fabregas, A.
Copyright Year	1963
Abstract	This paper studies expurgated random-coding bounds and exponents for channel coding with a given (possibly suboptimal) decoding rule. Variations of Gallager's analysis are presented, yielding several asymptotic and nonasymptotic bounds on the error probability for an arbitrary codeword distribution. A simple nonasymptotic bound is shown to attain an exponent of Csiszár and Körner under constant-composition coding. Using Lagrange duality, this exponent is expressed in several forms, one of which is shown to permit a direct derivation via cost-constrained coding that extends to infinite and continuous alphabets. The method of type class enumeration is studied, and it is shown that this approach can yield improved exponents and better tightness guarantees for some codeword distributions. A generalization of this approach is shown to provide a multiletter exponent that extends immediately to channels with memory.
Sponsorship	IEEE Information Theory Society
Starting Page	4449
Ending Page	4462
Page Count	14
File Size	432727
File Format	PDF
ISSN	00189448
Volume Number	60
Issue Number	8
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-01-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Decoding Error probability Encoding IP networks Measurement Electronic mail Joints type class enumeration Expurgated error exponents reliability function random coding mismatched decoding maximum-likelihood decoding
Content Type	Text
Resource Type	Article
Subject	Library and Information Sciences Information Systems Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Mismatched Decoding: Error Exponents, Second-Order Rates and Saddlepoint Approximations

On Achievable Rates and Error Exponents for Channels With Mismatched Decoding

List Decoding—Random Coding Exponents and Expurgated Exponents

Expurgated Random-Coding Ensembles: Exponents, Refinements and Connections

Error Exponents for Broadcast Channels With Degraded Message Sets

Universal Decoding for Arbitrary Channels Relative to a Given Class of Decoding Metrics

A General Formula for the Mismatch Capacity

Bit-Interleaved Coded Modulation Revisited: A Mismatched Decoding Perspective

On the Reliability Function of the Discrete Memoryless Relay Channel

Expurgated Random-Coding Ensembles: Exponents, Refinements, and Connections

Similar Documents

Mismatched Decoding: Error Exponents, Second-Order Rates and Saddlepoint Approximations

On Achievable Rates and Error Exponents for Channels With Mismatched Decoding

List Decoding—Random Coding Exponents and Expurgated Exponents

Expurgated Random-Coding Ensembles: Exponents, Refinements and Connections

Error Exponents for Broadcast Channels With Degraded Message Sets

Universal Decoding for Arbitrary Channels Relative to a Given Class of Decoding Metrics

A General Formula for the Mismatch Capacity

Bit-Interleaved Coded Modulation Revisited: A Mismatched Decoding Perspective

On the Reliability Function of the Discrete Memoryless Relay Channel

Expurgated Random-Coding Ensembles: Exponents, Refinements, and Connections