#### Filter Results:

- Full text PDF available (39)

#### Publication Year

2004

2017

- This year (4)
- Last 5 years (13)
- Last 10 years (36)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Gildas Avoine, Aslan Tchamkerten
- ISC
- 2009

The Mafia fraud consists in an adversary transparently relaying the physical layer signal during an authentication process between a verifier and a remote legitimate prover. This attack is a major concern for certain RFID systems, especially for payment related applications. Previously proposed protocols that thwart the Mafia fraud treat relaying andâ€¦ (More)

- Aslan Tchamkerten, Venkat Chandar, Gregory W. Wornell
- IEEE Transactions on Information Theory
- 2009

A formulation of the problem of asynchronous point-to-point communication is developed. In the system model of interest, the message codeword is transmitted over a channel starting at a randomly chosen time within a prescribed window. The length of the window scales exponentially with the codeword length, where the scaling parameter is referred to as theâ€¦ (More)

- Aslan Tchamkerten
- IEEE Transactions on Information Theory
- 2004

We consider a scalar additive channel x /spl rarr/ x + N whose input is amplitude constrained. By extending Smith's (1969) argument, we derive a sufficient condition on noise probability density functions (pdf) that guarantee finite support for the associated capacity-achieving distribution(s).

- Venkat Chandar, Aslan Tchamkerten, Gregory W. Wornell
- IEEE Transactions on Information Theory
- 2008

We consider the ldquoone-shot frame synchronization problem,rdquo where a decoder wants to locate a sync pattern at the output of a memoryless channel on the basis of sequential observations. The sync pattern of length <i>N</i> starts being emitted at a random time within some interval of size <i>A</i>, where <i>A</i> characterizes the asynchronism level.â€¦ (More)

- Aslan Tchamkerten, Venkat Chandar, Gregory W. Wornell
- IEEE Transactions on Information Theory
- 2013

Several aspects of the problem of asynchronous point-to-point communication without feedback are developed when the source is highly intermittent. In the system model of interest, the codeword is transmitted at a random time within a prescribed window whose length corresponds to the level of asynchronism between the transmitter and the receiver. The decoderâ€¦ (More)

- Ashish Khisti, Aslan Tchamkerten, Gregory W. Wornell
- IEEE Transactions on Information Theory
- 2008

We study a problem of broadcasting confidential messages to multiple receivers under an information-theoretic secrecy constraint. Two scenarios are considered: 1) all receivers are to obtain a common message; and 2) each receiver is to obtain an independent message. Moreover, two models are considered: parallel channels and fast-fading channels. For theâ€¦ (More)

- Aslan Tchamkerten, Emre Telatar
- IEEE Transactions on Information Theory
- 2006

Burnashev in 1976 gave an exact expression for the reliability function of a discrete memoryless channel (DMC) with noiseless feedback. A coding scheme that achieves this exponent needs, in general, to know the statistics of the channel. Suppose now that the coding scheme is designed knowing only that the channel belongs to a family Q of DMCs. Is there aâ€¦ (More)

- Venkat Chandar, Aslan Tchamkerten, David Tse
- IEEE Transactions on Information Theory
- 2010

The capacity per unit cost, or, equivalently, the minimum cost to transmit one bit, is a well-studied quantity under the assumption of full synchrony between the transmitter and the receiver. In many applications, such as sensor networks, transmissions are very bursty, with amounts of bits arriving infrequently at random times. In such scenarios, the costâ€¦ (More)

- Ehsan Ebrahimzadeh, Aslan Tchamkerten
- 2015 IEEE International Symposium on Informationâ€¦
- 2015

The problem of detecting a transient change in distribution of a discrete time series is investigated when there is a constraint on the number of observed samples. Under a minimax setting where the change time is unknown, the objective is to design a statistical test that minimizes a measure of worst case delay under a constraint on the average time toâ€¦ (More)

- GÃ©rard D. Cohen, Patrick SolÃ©, Aslan Tchamkerten
- 2010 IEEE International Symposium on Informationâ€¦
- 2010

Motivated by certain recent problems in asynchronous communication, we introduce and study B(n, d, w), defined as the maximum number of length n binary sequences with minimum distance d, and such that each sequence has weight at least w. Specifically, we investigate the asymptotic exponential growth rate of B(n, d, w) with respect to n and with fixed ratiosâ€¦ (More)