Noisy Constrained Capacity for BSC Channels

DOI10.1109/TIT.2010.2069170zbMATH Open1366.94192OpenAlexW2158461354MaRDI QIDQ5281204FDOQ5281204

Authors: Wojciech Szpankowski, Philippe Jacquet 

Publication date: 27 July 2017

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

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

Recommendations

• On the Capacity of a Class of Signal-Dependent Noise Channels
• Capacity of Burst Noise-Erasure Channels With and Without Feedback and Input Cost
• Block codes for a class of constrained noiseless channels
• The capacity of finite-state channels in the high-noise regime
• On the capacity of channels with Gaussian and non-Gaussian noise
• Bounds on the zero-error capacity of the input-constrained bit-shift channel
• Communication Channel Capacity with Almost Gaussian Noise
• Dual Capacity Upper Bounds for Noisy Runlength Constrained Channels
• Feedback capacity and coding for the BIBO channel with a no-repeated-ones input constraint
• On the zero-rate error exponent for a BSC with noisy feedback

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Measures of information, entropy (94A17) Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40)

This page was built for publication: Noisy Constrained Capacity for BSC Channels

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