Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/7623
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kovačević, Mladen | en_US |
dc.contributor.author | Popovski, Petar | en_US |
dc.date.accessioned | 2019-09-30T09:03:16Z | - |
dc.date.available | 2019-09-30T09:03:16Z | - |
dc.date.issued | 2014-01-01 | - |
dc.identifier.issn | 00189448 | en_US |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/7623 | - |
dc.description.abstract | © 2014 IEEE. We analyze the problem of zero-error communication through timing channels that can be interpreted as discrete-time queues with bounded waiting times. The channel model includes the following assumptions: 1) time is slotted; 2) at most N particles are sent in each time slot; 3) every particle is delayed in the channel for a number of slots chosen randomly from the set {0, 1,K}) ; and 4) the particles are identical. It is shown that the zero-error capacity of this channel is log r , where \(r\) is the unique positive real root of the polynomial (xK+1-xK}-N\). Capacity-achieving codes are explicitly constructed, and a linear-time decoding algorithm for these codes devised. In the particular case \(N = 1 \) , \(K = 1 \) , the capacity is equal to log φ) , where φ = (1 + {5})/2 \) is the golden ratio, and constructed codes give another interpretation of the Fibonacci sequence. | en |
dc.relation.ispartof | IEEE Transactions on Information Theory | en |
dc.title | Zero-error capacity of a class of timing channels | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.doi | 10.1109/TIT.2014.2352613 | - |
dc.identifier.scopus | 2-s2.0-84908246003 | - |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/84908246003 | - |
dc.description.version | Unknown | en_US |
dc.relation.lastpage | 6800 | en |
dc.relation.firstpage | 6796 | en |
dc.relation.issue | 11 | en |
dc.relation.volume | 60 | en |
item.fulltext | No Fulltext | - |
item.grantfulltext | none | - |
Appears in Collections: | Naučne i umetničke publikacije |
SCOPUSTM
Citations
25
checked on Mar 15, 2024
Page view(s)
42
Last Week
9
9
Last month
0
0
checked on May 3, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.