Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Guessing Cost: Bounds and Applications to Data Repair in Distributed Storage (2005.06666v4)

Published 13 May 2020 in cs.IT, cs.DC, and math.IT

Abstract: The guesswork refers to the distribution of the minimum number of trials needed to guess a realization of a random variable accurately. In this study, a non-trivial generalization of the guesswork called guessing cost (also referred to as cost of guessing) is introduced, and an optimal strategy for finding the $\rho$-th moment of guessing cost is provided for a random variable defined on a finite set whereby each choice is associated with a positive finite cost value (unit cost corresponds to the original guesswork). Moreover, we drive asymptotically tight upper and lower bounds on the logarithm of guessing cost moments. Similar to previous studies on the guesswork, established bounds on the moments of guessing cost quantify the accumulated cost of guesses required for correctly identifying the unknown choice and are expressed in terms of R\'enyi's entropy. Moreover, new random variables are introduced to establish connections between the guessing cost and the guesswork, leading to induced strategies. Establishing this implicit connection helped us obtain improved bounds for the non-asymptotic region. As a consequence, we establish the guessing cost exponent in terms of R\'enyi entropy rate on the moments of the guessing cost using the optimal strategy by considering a sequence of independent random variables with different cost distributions. Finally, with slight modifications to the original problem, these results are shown to be applicable for bounding the overall repair bandwidth for distributed data storage systems backed up by base stations and protected by bipartite graph codes.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (31)
  1. J. O. Pliam. (1999) The Disparity Between Work and Entropy in Cryptology. Available Online: http://philby.ucsd.edu/cryptolib/1998/98-24.html
  2. J. L. Massey, “Guessing and entropy,” in Proc. IEEE Int. Symp. on Information Theory Trondheim, Norway, 1994, pp. 204.
  3. R. J. McEliece and Z. Yu, “An inequality on entropy,” in Proc. IEEE International Symposium on Information Theory, p. 329, Whistler, Canada, September 1995.
  4. E. Arikan, “An inequality on guessing and its application to sequential decoding,” IEEE Trans. Inform. Theory, vol. 42, pp. 99–105, Jan. 1996.
  5. S. Boztas, “Comments on "An inequality on guessing and its application to sequential decoding"," in IEEE Transactions on Information Theory, vol. 43, no. 6, pp. 2062-2063, Nov. 1997.
  6. I. Sason and S. Verdú, “Improved Bounds on Guessing Moments via Rényi Measures," in Proc. IEEE International Symposium on Information Theory (ISIT), Vail, CO, 2018, pp. 566-570.
  7. L. L. Campbell, “A coding theorem and Rényi’s entropy." Information and control 8.4: 423-429, 1965.
  8. S. Kuzuoka, “On the Conditional Smooth Rényi Entropy and Its Application in Guessing," in Proc. IEEE International Symposium on Information Theory (ISIT), Paris, France, 2019, pp. 647-651.
  9. K. R. Duffy, J. Li and M. Médard, “Capacity-Achieving Guessing Random Additive Noise Decoding," in IEEE Transactions on Information Theory, vol. 65, no. 7, pp. 4023-4040, July 2019.
  10. A. Bracher, E. Hof and A. Lapidoth, “Guessing Attacks on Distributed-Storage Systems," in IEEE Transactions on Information Theory, vol. 65, no. 11, pp. 6975-6998, Nov. 2019.
  11. D. Malone and W. G. Sullivan, “Guesswork and entropy," in IEEE Transactions on Information Theory, vol. 50, no. 3, pp. 525-526, March 2004.
  12. M. Noroozi and Z. Eslami, “Public-key encryption with keyword search: A generic construction secure against online and offline keyword guessing attacks,” J. Ambient Intell. Humanized Comput., 2019.
  13. Ivan Niven, “Coding Theory Applied to a Problem of Ulam.” Math. Mag. 61 (1988) 275-281.
  14. E. Arikan and S. Boztas, “Guessing with lies,” in IEEE International Symposium on Information Theory, Lausanne, Switzerland, 2002, pp. 208-,.
  15. K. R. Duffy, M. Médard and W. An, “Guessing Random Additive Noise Decoding With Symbol Reliability Information (SRGRAND)," in ‘IEEE Transactions on Communications, vol. 70, no. 1, pp. 3-18, Jan. 2022.
  16. E. Haytaoglu, E. Kaya and S. S. Arslan, “Data Repair-Efficient Fault Tolerance for Cellular Networks Using LDPC Codes," in IEEE Transactions on Communications, vol. 70, no. 1, pp. 19-31, Jan. 2022.
  17. A. Renyi, “On Measures of Information and Entropy,” Proc. 4th Berkeley Symp. Math., Stat. Prob., vol. 1, pp. 547-561, 1960.
  18. R. Gallager, “Low-density parity-check codes," in IRE Transactions on Information Theory, vol. 8, no. 1, pp. 21-28, January 1962.
  19. M. Luby, M. Mitzenmacher, and A. Shokrollahi, “Analysis of random processes via and-or tree evaluation,” in Proc. 9th Annu. ACM-SIAM Symp. Discrete Algorithms, 1998, pp. 364–373.
  20. M. Le, Z. Song, Y. Kwon and E. Tilevich, “Reliable and efficient mobile edge computing in highly dynamic and volatile environments," Second International Conference on Fog and Mobile Edge Computing (FMEC), 2017, pp. 113-120.
  21. A. Amraoui, A. Montanari, and R. Urbanke, “How to find good finitelength codes: From art towards science,” in Europ. Trans. Telecomm., vol. 18, pp. 491–508, 2007.
  22. T. J. Richardson, M. A. Shokrollahi and R. L. Urbanke, “Design of capacity-approaching irregular low-density parity-check codes," in IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 619-637, Feb 2001.
  23. W. K. Lai and E. Kim, “Some inequalities involving geometric and harmonic means," In International Mathematical Forum, (2016), Vol. 11, No. 4, pp. 163-169.
  24. H. Park, D. Lee and J. Moon, “LDPC code design for distributed storage: Balancing repair bandwidth, reliability, and storage overhead," in IEEE Transactions on Communications, 66(2), 507-520, 2017.
  25. S. S. Dragomir and J. v. d. Hoek. “New inequalities for the moments of guessing mapping," East Asian Math. Journal, 14 (1)(1998), pp. 1-14.
  26. J. Williams, “Algorithm 232: Heapsort," Communications of the ACM, 7 (6) (1964), pp. 347–348.
  27. D. Knuth . “Section 5.2.4: Sorting by Merging". Sorting and Searching. The Art of Computer Programming." 3 (2nd ed.) (1998), Addison-Wesley. pp. 158–168.
  28. A. Bracher, E. Hof and A. Lapidoth, “Guessing Attacks on Distributed-Storage Systems," 2015 IEEE International Symposium on Information Theory (ISIT), Hong Kong, China, 2015, pp. 1585-1589, doi: 10.1109/ISIT.2015.7282723.
  29. M. M. Christiansen, K. R. Duffy, F. du Pin Calmon and M. Médard, "Multi-User Guesswork and Brute Force Security,“ in IEEE Transactions on Information Theory, vol. 61, no. 12, pp. 6876-6886, Dec. 2015, doi:
  30. W. Huleihel, S. Salamatian and M. Médard, “Guessing with limited memory," 2017 IEEE International Symposium on Information Theory (ISIT), Aachen, Germany, 2017, pp. 2253-2257, doi: 10.1109/ISIT.2017.8006930.
  31. M. A. Kumar, A. Sunny, A. Thakre, A. Kumar and G. D. Manohar, “A Unified Framework for Problems on Guessing, Source Coding, and Tasks Partitioning," 2022 IEEE International Symposium on Information Theory (ISIT), Espoo, Finland, 2022, pp. 3339-3344, doi: 10.1109/ISIT50566.2022.9834851.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now