A binary channel characterization using partitioned Markov chains
From MaRDI portal
Publication:5527521
DOI10.1109/TIT.1967.1053975zbMath0148.40503MaRDI QIDQ5527521
Publication date: 1967
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
finite-state Markov chainsbinary communication channelserror-cluster distributionerror-free run distribution
Related Items (8)
Unnamed Item ⋮ Markov jump linear systems and filtering through network transmitted measurements ⋮ Performance models for wireless channels ⋮ \(\mathcal H_{\infty}\) robust and networked control of discrete-time MJLS through LMIs ⋮ Efficient Error-Correcting Codes for Sliding Windows ⋮ On the structure of data losses induced by an overflowed buffer ⋮ Hardware simulation of semi-Markov and related processes. II: Simulation of noise pulses on data channels and other applications ⋮ Discrete-time H∞ output feedback for Markov jump systems with uncertain transition probabilities
This page was built for publication: A binary channel characterization using partitioned Markov chains