NDLI: First- and second-order coding theorems for mixed memoryless channels with general mixture

Content Provider	IEEE Xplore Digital Library
Author	Yagi, H. Te Sun Han Nomura, R.
Copyright Year	2015
Description	Author affiliation: Nat. Inst. of Inf. & Commun. Technol., Tokyo, Japan (Te Sun Han) \|\| Dept. of Commun. Eng. & Inf., Univ. of Electro-Commun., Chofu, Japan (Yagi, H.) \|\| Sch. of Network & Inf., Senshu Univ., Kanagawa, Japan (Nomura, R.)
Abstract	This paper studies the first- and second-order maximum achievable rates of codes with/without cost constraints for general mixed channels whose channel law is characterized by a mixture of uncountably many stationary and memoryless discrete channels. These channels are referred to as general mixed memoryless channels and include mixed memoryless channels of finitely or countably many memoryless channels as a special case. For general mixed memoryless channels, the first-order coding theorem which gives a formula for the ε-capacity is established, and then a direct part of the second-order coding theorem is provided. A subclass of general mixed memoryless channels whose component channels can be ordered according to their capacity is introduced, and the first- and second-order coding theorems are established. It is shown that the established formulas reduce to several known formulas for restricted scenarios.
Starting Page	2969
Ending Page	2973
File Size	100819
Page Count	5
File Format	PDF
ISSN	21578117
e-ISBN	9781467377041
DOI	10.1109/ISIT.2015.7283001
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-06-14
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Memoryless systems Manganese Channel coding Probability distribution Channel capacity Decoding
Content Type	Text
Resource Type	Article

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

Single-letter characterization of epsilon-capacity for mixed memoryless channels

On two strong converse theorems for discrete memoryless channels

First- and Second-Order Coding Theorems for Mixed Memoryless Channels with General Mixture

Channel dispersion for well-ordered mixed channels decomposed into memoryless channels

Second-order Slepian-Wolf coding theorems for non-mixed and mixed sources

Second-order capacities of erasure and list decoding

The zero-undetected-error capacity of discrete memoryless channels with feedback

Jar decoding: LDPC coding theorems for binary input memoryless channels

Achieving capacity of large alphabet discrete memoryless channels

First- and second-order coding theorems for mixed memoryless channels with general mixture

Similar Documents

Single-letter characterization of epsilon-capacity for mixed memoryless channels

On two strong converse theorems for discrete memoryless channels

First- and Second-Order Coding Theorems for Mixed Memoryless Channels with General Mixture

Channel dispersion for well-ordered mixed channels decomposed into memoryless channels

Second-order Slepian-Wolf coding theorems for non-mixed and mixed sources

Second-order capacities of erasure and list decoding

The zero-undetected-error capacity of discrete memoryless channels with feedback

Jar decoding: LDPC coding theorems for binary input memoryless channels

Achieving capacity of large alphabet discrete memoryless channels

First- and second-order coding theorems for mixed memoryless channels with general mixture