Name
Abstract | ||
|---|---|---|
We model biochemical signal transduction, based on a ligand-receptor binding mechanism, as a discrete-time finite-state Markov channel, which we call the binding in discrete time channel. We show how to obtain the capacity of this channel, for the case of binary output, binary channel state, and arbitrary finite input alphabets. We show that the capacity-achieving input distribution is identically and independently distributed. Furthermore, we show that feedback does not increase the capacity of this channel. We show how the capacity of the discrete-time channel approaches the capacity of Kabanov’s Poisson channel, in the limit of short time steps and rapid ligand release. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/TIT.2016.2599178 | IEEE Trans. Information Theory |
Keywords | Field | DocType |
Proteins,Biological system modeling,Biological information theory,Channel capacity,Chemicals,Markov processes | Discrete mathematics,Topology,Telecommunications,Markov process,Markov channels,Computer science,Poisson channel,Communication channel,Discrete time and continuous time,Channel capacity,Binary number | Journal |
Volume | Issue | ISSN |
62 | 12 | 0018-9448 |
Citations | PageRank | References |
2 | 0.38 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peter J. Thomas | 1 | 133 | 41.24 |
| Andrew W. Eckford | 2 | 444 | 44.21 |