A simple class of capacity-achieving strategies for discrete memoryless channels with feedback

DOI10.1109/18.556610MaRDI QIDQ4336404zbMATH OpenOpenAlexFDO

Authors Thijs Veugen

Publication date 12 May 1997

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

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

zbMATH Keywords

capacityfeedbackdiscrete memoryless channelsconstrained sequencesrepetition strategy

Mathematics Subject Classification ID

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

Recommendations

• Feedback strategies for a class of two-user multiple-access channels
• Fast iterative coding techniques for feedback channels
• Partial feedback for the discrete memoryless multiple access channel (Corresp.)
• Upper bounds on the capacity of Gaussian channels with feedback
• scientific article; zbMATH DE number 4039791

Cited in

(7)

• The capacity-cost function of discrete additive noise channels with and without feedback
• The feedback capacity region of a class of discrete memoryless multiple access channels (Corresp.)
• Capacity of Memoryless Channels and Block-Fading Channels With Designable Cardinality-Constrained Channel State Feedback
• Achievable Rates for the Discrete Memoryless Relay Channel With Partial Feedback Configurations
• Feedback strategies for a class of two-user multiple-access channels
• Capacity of the Trapdoor Channel With Feedback
• Capacity results for the discrete memoryless network

This page was built for publication: A simple class of capacity-achieving strategies for discrete memoryless channels with feedback

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