Fetching the paper…
Reading the bibliography…
We study the problem of mismatched guesswork, where we evaluate the number of symbols $y \in \mathcal{Y}$ which have higher likelihood than $X \sim \mu$ according to a mismatched distribution $\nu$.
1907
Earlier work this paper cites.
J. L. Massey, “Guessing and entropy,” in IEEE ISIT , 1994, p. 204
1994
Earlier work this paper cites.
E. Arikan, “An inequality on guessing and its application to sequential decoding,” IEEE Trans. on Inf. Theory , vol. 42, no. 1, pp. 99–105, 1996
1996
Earlier work this paper cites.
E. Arikan and N. Merhav, “Guessing subject to distortion,” IEEE Trans. on Inf. Theory , vol. 44, no. 3, pp. 1041–1056, May 1998
1998
Earlier work this paper cites.
A. Dembo and O. Zeitouni, Large Deviations Techniques and Applications . Springer, 1998
1998
Earlier work this paper cites.
I. Csiszár, P. C. Shields et al. , “Information theory and statistics: A tutorial,” Foundations and Trends® in Comm. and Inf. Theory , vol. 1, no. 4, pp. 417–528, 2004
2004
Earlier work this paper cites.
S. Boyd and L. Vandenberghe, Convex optimization . Cambridge university press, 2004
2004
Earlier work this paper cites.
R. Sundaresan, “Guessing under source uncertainty,” IEEE Trans. on Inf. Theory , vol. 53, no. 1, pp. 525–526, Jan. 2007
2007
Earlier work this paper cites.
W. Szpankowski, “A one-to-one code and its anti-redundancy,” IEEE Trans. on Inf. Theory , vol. 54, no. 10, pp. 4762–4766, 2008
2008
Cited alongside, same era.
M. K. Hanawal and R. Sundaresan, “Guessing revisited: A large deviations approach,” IEEE Trans. on Inf. Theory , vol. 57, no. 1, pp. 70–78, Jan. 2011
2011
Cited alongside, same era.
M. M. Christiansen and K. R. Duffy, “Guesswork, large deviations, and Shannon entropy,” IEEE Trans. on Inf. Theory , vol. 59, no. 2, pp. 796–802, Feb. 2013
2013
Cited alongside, same era.
N. Merhav, “List decoding-random coding exponents and expurgated exponents,” IEEE Trans. on Inf. Theory , vol. 60, no. 11, pp. 6749–6759, Nov. 2014
2014
Cited alongside, same era.
W. Huleihel, N. Weinberger, and N. Merhav, “Erasure/list random coding error exponents are not universally achievable,” IEEE Trans. on Inf. Theory , 2014
A. Beirami, R. Calderbank, K. Duffy, and M. Médard, “Quantifying computational security subject to source constraints, guesswork and inscrutability,” in IEEE ISIT , 2015
2015
Later among the works it cites.
A. Beirami, R. Calderbank, M. Christiansen, K. Duffy, A. Makhdoumi, and M. Médard, “A geometric perspective on guesswork,” in Allerton Conf. on Comm., Control, and Computing , 2015
2015
Later among the works it cites.
O. Kosut and L. Sankar, “Asymptotics and non-asymptotics for universal fixed-to-variable source coding,” IIEEE Trans. Inf. Theory , 2017
2017
Later among the works it cites.
S. Salamatian, A. Beirami, A. Cohen, and M. Médard, “Centralized vs decentralized multi-agent guesswork,” in IEEE ISIT , 2017
2017
Later among the works it cites.
A. Rezaee, A. Beirami, A. Makhdoumi, M. Médard, and K. Duffy, “Guesswork subject to a total entropy budget,” in Allerton Conf. on Comm., Control, and Computing . IEEE, 2017, pp. 1008–1015
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2014
Cited alongside, same era.
A. Beirami and F. Fekri, “Fundamental limits of universal lossless one-to-one compression of parametric sources,” in IEEE ITW , 2014
2014
Cited alongside, same era.
T. A. Courtade and S. Verdú, “Cumulant generating function of codeword lengths in optimal lossless compression.” in ISIT , 2014
2014
Cited alongside, same era.
M. M. Christiansen, K. R. Duffy, F. du Pin Calmon, and M. Médard, “Multi-user guesswork and brute force security,” IEEE Trans. Inf. Theory , vol. 61, no. 12, pp. 6876–6886, 2015
2015
Cited alongside, same era.
2017
Later among the works it cites.
2018
Later among the works it cites.
A. Beirami, R. Calderbank, M. Christiansen, K. Duffy, and M. Médard, “A characterization of guesswork on swiftly tilting curves,” IEEE Trans. Inf. Theory , 2019
2019
Closest in time.
S. Salamatian, W. Huleihel, A. Beirami, A. Cohen, and M. Médard, “Why botnets work: distributed brute-force attacks need no synchronization,” IEEE Trans. on Inform. Forensics and Security , 2019
2019
Closest in time.