NDLI: Uniquely decodable codes for deterministic relay channels

Content Provider	IEEE Xplore Digital Library
Author	Vanroose, P. van der Meulen, E.C.
Copyright Year	1963
Abstract	The deterministic relay channel is analyzed and explicit code constructions for all binary and all ternary/binary channels are given. An explicit set of equivalence conditions is used to make a classification of all such relay channels, for which also the capacity is evaluated. The coding problem is then reduced to finding all possible output sequences of a certain finite-state channel determined by the relay coding strategy. The channel states correspond to the possible relay memory contents. For some relay channels capacity is reached by using simple uniquely decodable codes, thus establishing the zero-error capacity of those channels with finite-memory relay strategies. For other relay channels the relay memory must be arbitrarily large to achieve zero-error rates arbitrarily close to capacity. One such code construction is given. It is not known whether there exist relay channels for which the zero-error capacity is strictly smaller than the average-error capacity. The code construction problem for the semideterministic relay channel and for the nonsynchronized relay channel is briefly considered.<>
Sponsorship	IEEE Information Theory Society
Starting Page	1203
Ending Page	1212
Page Count	10
File Size	1034956
File Format	PDF
ISSN	00189448
Volume Number	38
Issue Number	4
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1992-07-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 Relays Degradation Channel capacity Mathematics Capacity planning Communication system control Codes Information rates Mutual information
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

Capacity of a Class of Deterministic Relay Channels

On the deterministic-code capacity of the multiple-access arbitrarily varying channel

On the capacity of a cascade of channels

Improved Lower Bounds for the Capacity of i.i.d. Deletion and Duplication Channels

New Uniquely Decodable Codes for the $T$-User Binary Adder Channel With $3 le T le 5$

Achievable Rates for the Discrete Memoryless Relay Channel With Partial Feedback Configurations

The Capacity of a Relay Channel, Both With and Without Delay

Identification plus transmission over channels with perfect feedback

Capacity of a Class of Modulo-Sum Relay Channels

Uniquely decodable codes for deterministic relay channels

Similar Documents

Capacity of a Class of Deterministic Relay Channels

On the deterministic-code capacity of the multiple-access arbitrarily varying channel

On the capacity of a cascade of channels

Improved Lower Bounds for the Capacity of i.i.d. Deletion and Duplication Channels

New Uniquely Decodable Codes for the $T$-User Binary Adder Channel With $3 le T le 5$

Achievable Rates for the Discrete Memoryless Relay Channel With Partial Feedback Configurations

The Capacity of a Relay Channel, Both With and Without Delay

Identification plus transmission over channels with perfect feedback

Capacity of a Class of Modulo-Sum Relay Channels

Uniquely decodable codes for deterministic relay channels