3 citations · 3 across the 3 of their papers we have counts for
5 papers
Covert queueing problem with a Markovian statistic
Arti Yardi, Tejas Bodas
Based on the covert communication framework, we consider a covert queueing problem that has a Markovian statistic. Willie jobs arrive according to a Poisson process and require ser…
EBP-GEXIT Charts for M-ary AWGN Channel for Generalized LDPC and Turbo Codes
Arti Yardi, Tarik Benaddi, Charly Poulliat +1
This work proposes a tractable estimation of the maximum a posteriori (MAP) threshold of various families of sparse-graph code ensembles, by using an approximation for the extended…
Properties of Syndrome Distribution for Blind Reconstruction of Cyclic Codes
Arti D. Yardi, Saravanan Vijayakumaran
In the problem of blind reconstruction of channel codes, the receiver does not have the knowledge of the channel code used at the transmitter and the aim is to identify this unknow…
On shortened and punctured cyclic codes
Arti Yardi, Ruud Pellikaan
The problem of identifying whether the family of cyclic codes is asymptotically good or not is a long-standing open problem in the field of coding theory. It is known in the litera…
Detecting Linear Block Codes in Noise using the GLRT
Arti D. Yardi, Saravanan Vijayakumaran
In this paper, we consider the problem of distinguishing the noisy codewords of a known binary linear block code from a random bit sequence. We propose to use the generalized likel…