A Binary Communication Channel With Memory Based on a Finite Queue

DOI10.1109/TIT.2007.901184MaRDI QIDQ3548939zbMATH OpenFDO

Authors Libo Zhong, Fady Alajaji, Glen Takahara

Publication date 21 December 2008

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

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

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• Publication:3495044
• Capacity and coding for the gilbert-elliott channels
• A binary channel characterization using partitioned Markov chains
• Models of information K-channels with memory
• On the capacity of a binary channel with timing jitter at signal transitions modeled as a random walk

Cited in

(1)

• scientific article; zbMATH DE number 4168390 (Why is no real title available?)

This page was built for publication: A Binary Communication Channel With Memory Based on a Finite Queue

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