People


Aslan Tchamkerten

Aslan Tchamkerten
Institution: 
■ Institut Mines-Telecom
Office: 
3C51
Groups: 
Associate member of the LINCS

Articles

⇣
A Simple Low Complexity Locally Private Compression Scheme,
Sidharth Jaggi, Shashank Vatedka, Venkat Chandar, Aslan Tchamkerten ■,
ISIT 2025
⇣
Compression with Privacy-Preserving Random Access,
Venkat Chandar, Aslan Tchamkerten ■, Shashank Vatedka,
CoRR 2025
⇣
Entropy-Achieving Compression with Private Local Decodability,
Venkat Chandar, Aslan Tchamkerten, Shashank Vatedka,
ISIT 2024
⇣
⇣
Data Compression with Private Local Decodability,
Venkat Chandar, Aslan Tchamkerten, Shashank Vatedka,
ISIT 2023, Taipeh, Taiwan, Province of China
⇣
⇣
Feedback Increases the Capacity of Queues with Finite Support Service Times,
Sahasranand, Aslan Tchamkerten,
ISIT 2023, Taipeh, Taiwan, Province of China
⇣
⇣
Locally Decodable Slepian-Wolf Compression,
Shashank Vatedka, Venkat Chandar, Aslan Tchamkerten,
ISIT 2022, Espoo, Finland
⇣
Random Access in Distributed Source Coding,
Shashank Vatedka, Venkat Chandar, Aslan Tchamkerten,
CoRR 2022
⇣
⇣
Zero-Error Sum Modulo Two with a Common Observation,
Milad Sefidgaran, Aslan Tchamkerten,
CoRR 2021, Riva del Garda, Italy
⇣
⇣
Approximating Probability Distributions by ReLU Networks,
Manuj Mukherjee, Aslan Tchamkerten, Mansoor Yousefi,
CoRR 2021, Riva del Garda, Italy
⇣
⇣
O (log log n) Worst-Case Local Decoding and Update Efficiency for Data Compression,
Shashank Vatedka, Venkat Chandar, Aslan Tchamkerten,
ISIT 2020, Los Angeles, United States
⇣
⇣
On the Optimal Input of the Nondispersive Optical Fiber,
Jihad Fahs, Aslan Tchamkerten, Mansoor Yousefi,
ISIT 2019, Paris, France
⇣
⇣
Local Decoding and Update of Compressed Data,
Shashank Vatedka, Aslan Tchamkerten,
ISIT 2019, Paris, France
⇣
Somatic mutations render human exome and pathogen DNA more similar,
Ehsan Ebrahimzadeh, Maggie Engler, David Tse, Razvan Cristescu, Aslan Tchamkerten,
CoRR 2019
⇣
⇣
Bounds on the Approximation Power of Feedforward Neural Networks,
Mohammad Mehrabi, Aslan Tchamkerten, Mansoor Yousefi,
ICML 2018, Stockholm, Sweden
⇣
⇣
Feedback Increases the Capacity of Queues,
Laure Aptel, Aslan Tchamkerten,
ISIT 2018, Vail, United States
⇣
⇣
Infinite dispersion in bursty communication,
Longguang Li, Aslan Tchamkerten,
ISIT 2017, Aachen, Germany
⇣
Capacity-Achieving Input Distributions in Nondispersive Optical Fibers,
Jihad Fahs, Aslan Tchamkerten, Mansoor Yousefi,
CoRR 2017
⇣
How to quickly detect a change while sleeping (almost) all the time [Invited paper],
V. Chandar, Aslan Tchamkerten,
Asilomar 2016 2016, Asilomar, United States
⇣
⇣
Sequential detection of transient changes in stochastic systems under a sampling constraint,
Ehsan Ebrahimzadeh, Aslan Tchamkerten,
ISIT 2015, Hong-Kong, China
⇣
⇣
Asynchronous capacity per unit cost under a receiver sampling constraint,
Venkat Chandar, Aslan Tchamkerten,
ISIT 2015, Hong-Kong, China
⇣
Quickest Transient-Change Detection under a Sampling Constraint,
Venkat Chandar, Aslan Tchamkerten,
CoRR 2015
⇣
Lattice Codes for the Binary Deletion Channel,
Lin Sok, Patrick Sole, Aslan Tchamkerten,
CoRR 2014
⇣
Energy and sampling constrained asynchronous communication (invited paper),
V. Chandar, Giuseppe Caire, Aslan Tchamkerten,
Information Theory and Applications 2013, San Diego, United States
⇣
⇣
Lattice based codes for insertion and deletion channels,
Lin Sok, Patrick Sole, Aslan Tchamkerten,
ISIT 2013, Istanbul, Türkiye
⇣
⇣
Distributed function computation over a tree network,
Milad Sefidgaran, Aslan Tchamkerten,
ITW 2013, Sevilla, Spain
⇣
⇣
On Cooperation in Multi-Terminal Computation and Rate Distortion,
Milad Sefidgaran, Aslan Tchamkerten,
CoRR 2013, Cambridge, MA, United States
⇣
On Function Computation over a Cascade Network (Invited Paper),
Milad Sefidgaran, Aslan Tchamkerten,
IEEE Information Theory Workshop 2012, Lausanne, Switzerland
⇣
⇣
On the capacity of the one-bit deletion and duplication channel,
Hamed Mirghasemi, Aslan Tchamkerten,
Allerton Conference 2012, Monticello, Illinois, United States
⇣
On function computation over a cascade network,
Milad Sefidgaran, Aslan Tchamkerten,
ITW 2012
⇣
Estimating a Gaussian random walk first-passage time from noisy or delayed observations,
Marat Burnashev, Aslan Tchamkerten,
ISIT 2011
⇣
Computing a function of correlated Sources: A rate region,
Milad Sefidgaran, Aslan Tchamkerten,
ISIT 2011
⇣
Computing a Function of Correlated Sources,
Milad Sefidgaran, Aslan Tchamkerten,
CoRR 2011
⇣
Heavy weight codes,
Gerard Cohen, Patrick Sole, Aslan Tchamkerten,
ISIT 2010
⇣
Tracking a Threshold Crossing Time of a Gaussian Random Walk Through Correlated Observations,
Marat Burnashev, Aslan Tchamkerten,
CoRR 2010
⇣
An Efficient Distance Bounding RFID Authentication Protocol: Balancing False-Acceptance Rate and Memory Requirement,
Gildas Avoine, Aslan Tchamkerten,
ISC 2009
⇣
Training-Based Schemes are Suboptimal for High Rate Asynchronous Communication,
Venkat Chandar, Aslan Tchamkerten, Gregory Wornell,
CoRR 2009
⇣
On the capacity region of asynchronous channels,
Aslan Tchamkerten, Venkat Chandar, Gregory Wornell,
ISIT 2008
⇣
An Asymptotically Optimal RFID Authentication Protocol Against Relay Attacks,
Gildas Avoine, Aslan Tchamkerten,
CoRR 2008
⇣
An asymptotically optimal RFID protocol against relay attacks,
Gildas Avoine, Aslan Tchamkerten,
IACR Cryptol. ePrint Arch. 2008
⇣
The Complexity of Tracking a Stopping Time,
Urs Niesen, Aslan Tchamkerten, Gregory Wornell,
ISIT 2007
⇣
Secure Broadcasting,
Ashish Khisti, Aslan Tchamkerten, Gregory Wornell,
CoRR 2007
⇣
Tracking Stopping Times,
Urs Niesen, Aslan Tchamkerten, Gregory Wornell,
CoRR 2007
⇣
Information Theoretic Perspectives on Synchronization,
Aslan Tchamkerten, Ashish Khisti, Gregory Wornell,
ISIT 2006
⇣
Optimal feedback schemes over unknown channels,
Aslan Tchamkerten, Emre Telatar,
ISIT 2004

Journal articles

⇣
Feedback Increases the Capacity of Queues With Bounded Service Times,
Sahasranand, Aslan Tchamkerten,
IEEE Trans. Inf. Theory 2024
⇣
⇣
Reconfigurable Adaptive Channel Sensing,
Manuj Mukherjee, Aslan Tchamkerten, Chadi Jabbour,
IEEE Transactions on Green Communications and Networking 2023
⇣
⇣
Error-Correction for Sparse Support Recovery Algorithms,
Mohammad Mehrabi, Aslan Tchamkerten,
IEEE Trans. Inf. Theory 2022, Melbourne, Australia
⇣
⇣
Local Decoding in Distributed Compression,
Shashank Vatedka, Venkat Chandar, Aslan Tchamkerten,
IEEE Journal on Selected Areas in Information Theory 2022
⇣
⇣
Capacity-Achieving Input Distribution in Per-Sample Zero-Dispersion Model of Optical Fiber,
Jihad Fahs, Aslan Tchamkerten, Mansoor Yousefi,
IEEE Transactions on Information Theory 2021
⇣
⇣
Bits Through Queues With Feedback,
Laure Aptel, Aslan Tchamkerten,
IEEE Transactions on Information Theory 2020
⇣
⇣
Local Decode and Update for Big Data Compression,
Shashank Vatedka, Aslan Tchamkerten,
IEEE Transactions on Information Theory 2020
⇣
⇣
Second-Order Asymptotics for Communication Under Strong Asynchronism,
Longguang Li, Aslan Tchamkerten,
IEEE Transactions on Information Theory 2019
⇣
⇣
Security of Distance-Bounding: A Survey,
Gildas Avoine, Muhammed Ali Bingol, Ioana Boureanu, Srdjan Capkun, Gerhard Hancke, Suleyman Kardas, Chong Hee Kim, Cedric Lauradoux, Benjamin Martin, Jorge Munilla, Alberto Peinado, Kasper Bonne Rasmussen, Dave Singelee, Aslan Tchamkerten, Rolando Trujillo Rasua, Serge Vaudenay,
ACM Computing Surveys 2019
⇣
⇣
Sampling Constrained Asynchronous Communication: How to Sleep Efficiently,
Venkat Chandar, Aslan Tchamkerten,
IEEE Transactions on Information Theory 2018
⇣
Somatic Mutations Render Human and Pathogen Exomes more Similar,
Maggie Engler, Aslan Tchamkerten, Razvan Cristescu,
PLoS ONE 2018
⇣
Lattice Codes for the Insertion and Deletion Channels,
Patrick Solé, L. Sok, Aslan Tchamkerten, Jean-Claude Belfiore,
IEEE Transactions on Information Theory 2018
⇣
Lattice Codes for Deletion and Repetition Channels,
Lin Sok, Jean Claude Belfiore, Patrick Sole, Aslan Tchamkerten,
IEEE Trans. Inf. Theory 2018
⇣
Distributed Function Computation Over a Rooted Directed Tree,
Milad Sefidgaran, Aslan Tchamkerten,
IEEE Trans. Inf. Theory 2016
⇣
⇣
Energy and Sampling Constrained Asynchronous Communication,
Aslan Tchamkerten, Venkat Chandar, Giuseppe Caire,
IEEE Trans. Inf. Theory 2014, Istanbul, Türkiye
⇣
Asynchronous Capacity per Unit Cost,
Venkat Chandar, Aslan Tchamkerten, David Tse,
IEEE Trans. Inf. Theory 2013
⇣
Asynchronous Communication: Capacity Bounds and Suboptimality of Training,
Aslan Tchamkerten, Venkat Chandar, Gregory Wornell,
IEEE Trans. Inf. Theory 2013
⇣
Sequential estimation of a threshold crossing time for a Gaussian random walk through correlated observations,
Marat Burnashev, Aslan Tchamkerten,
Probl. Inf. Transm. 2012
⇣
Estimating a Random Walk First-Passage Time From Noisy or Delayed Observations,
Marat Burnashev, Aslan Tchamkerten,
IEEE Trans. Inf. Theory 2012
⇣
⇣
On Bounded Weight Codes,
Christine Bachoc, Venkat Chandar, Gerard Cohen, Patrick Sole, Aslan Tchamkerten,
IEEE Transactions on Information Theory 2011
⇣
Tracking Stopping Times Through Noisy Observations,
Urs Niesen, Aslan Tchamkerten,
IEEE Trans. Inf. Theory 2009
⇣
Communication under strong asynchronism,
Aslan Tchamkerten, Venkat Chandar, Gregory Wornell,
IEEE Trans. Inf. Theory 2009
⇣
⇣
Optimal Sequential Frame Synchronization,
Venkat Chandar, Aslan Tchamkerten, Gregory Wornell,
IEEE Transactions on Information Theory 2008
⇣
Secure Broadcasting Over Fading Channels,
Ashish Khisti, Aslan Tchamkerten, Gregory Wornell,
IEEE Trans. Inf. Theory 2008
⇣
On the use of training sequences for channel estimation,
Aslan Tchamkerten, Emre Telatar,
IEEE Trans. Inf. Theory 2006
⇣
Variable length coding over an unknown channel,
Aslan Tchamkerten, Emre Telatar,
IEEE Trans. Inf. Theory 2006
⇣
On the universality of Burnashev's error exponent,
Aslan Tchamkerten, Emre Telatar,
IEEE Trans. Inf. Theory 2005

Patents

⇣
Devices and methods for low power adaptive channel sensing,
Aslan Tchamkerten, Chadi Jabbour, Manuj Mukherjee,
2023, France
⇣
Method for transient change detection with adaptive sampling, and detector implementing the method,
Aslan Tchamkerten, Venkat Chandar,
2018, France
Generated using minifold and minifold-lincs at 2026-04-17 18:19.