Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

A Binary Communication Channel With Memory Based on a Finite Queue

From MaRDI portal
Publication:3548939
Jump to:navigation, search

DOI10.1109/TIT.2007.901184zbMATH Open1325.94105MaRDI QIDQ3548939FDOQ3548939


Authors: Libo Zhong, Fady Alajaji, Glen Takahara Edit this on Wikidata


Publication date: 21 December 2008

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





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


Mathematics Subject Classification ID

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



Cited In (1)

  • Title not available (Why is that?)





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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3548939&oldid=16933503"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 5 February 2024, at 01:14. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki