Uniquely decodable codes for deterministic relay channels

DOI10.1109/18.144701MaRDI QIDQ4014136zbMATH OpenOpenAlexFDO

Authors Peter Vanroose, Edward C. van der Meulen

Publication date 11 October 1992

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.144701

Mathematics Subject Classification ID

Communication theory (94A05) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• Capacity of a Class of Deterministic Relay Channels
• Channel capacity for a given decoding metric
• Algebraic Codes Achieving the Capacity of the Binary Symmetric Channel
• Zero-error capacity for models with memory and the enlightened dictator channel
• A family of good uniquely decodable code pairs for the two-access binary adder channel

Cited in

(2)

• Is Non-Unique Decoding Necessary?
• Capacity of a Class of Deterministic Relay Channels

This page was built for publication: Uniquely decodable codes for deterministic relay channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4014136)