On the capacity of a cascade of channels

DOI10.1109/18.243448MaRDI QIDQ4307335zbMATH OpenOpenAlexFDO

Authors Aaron B. Kiely, John T. Coffey

Publication date 4 October 1994

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

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

zbMATH Keywords

capacitycascade systemscomplexitymemoryless channelsnetworksoptimization

Mathematics Subject Classification ID

Communication theory (94A05) Information theory (general) (94A15)

Recommendations

• On the capacity of a cascade of identical discrete memoryless nonsingular channels (Corresp.)
• Capacity of dimension-limited channels
• Three-terminal communication channels
• The capacity of coded systems
• scientific article; zbMATH DE number 3809458

Cited in

(10)

• Capacity of the product and sum of two unmatched broadcast channels
• An information-theoretic approach to the design of a distributed cascade of sensors
• On the capacity of a multiple-access vector adder channel
• Efficient Approximation of Channel Capacities
• scientific article; zbMATH DE number 3809458 (Why is no real title available?)
• scientific article; zbMATH DE number 4114549 (Why is no real title available?)
• Progress Towards Achieving Channel Capacity
• Sharp Analytical Capacity Upper Bounds for Sticky and Related Channels
• On the capacity of a cascade of identical discrete memoryless nonsingular channels (Corresp.)
• Three-terminal communication channels

This page was built for publication: On the capacity of a cascade of channels

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