A
Aslan Tchamkerten
Researcher at Télécom ParisTech
Publications - 96
Citations - 1404
Aslan Tchamkerten is an academic researcher from Télécom ParisTech. The author has contributed to research in topics: Communication channel & Asynchronous communication. The author has an hindex of 17, co-authored 92 publications receiving 1315 citations. Previous affiliations of Aslan Tchamkerten include École Normale Supérieure & École Polytechnique Fédérale de Lausanne.
Papers
More filters
Journal ArticleDOI
Secure Broadcasting Over Fading Channels
TL;DR: It is shown that, using a suitable binning strategy, a common message can be reliably and securely transmitted at a rate independent of the number of receivers, and that a simple opportunistic transmission strategy is optimal for the reliable and secure transmission of independent messages in the limit of large number of receiver.
Book ChapterDOI
An Efficient Distance Bounding RFID Authentication Protocol: Balancing False-Acceptance Rate and Memory Requirement
Gildas Avoine,Aslan Tchamkerten +1 more
TL;DR: A low complexity authentication protocol that achieves a probability of false-acceptance essentially equal to the best possible false- acceptance probability in the presence of Mafia frauds is proposed.
Journal ArticleDOI
Variable length coding over an unknown channel
Aslan Tchamkerten,I.E. Telatar +1 more
TL;DR: It is shown that, for any given fraction, there is a feedback coding strategy such that for any member of the family: i) guarantees this fraction of its capacity as rate, and ii) guarantees the corresponding Burnashev's exponent.
Journal ArticleDOI
On the discreteness of capacity-achieving distributions
TL;DR: By extending Smith's (1969) argument, a sufficient condition on noise probability density functions is derived that guarantees finite support for the associated capacity-achieving distribution(s) of a scalar additive channel.
Journal ArticleDOI
Communication Under Strong Asynchronism
TL;DR: The use of generalized constant-composition codebooks and sequential decoding is shown to be sufficient for achieving reliable communication under strictly positive asynchronism exponents at all rates less than the capacity of the synchronized channel.