2000 character limit reached
Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing (2405.07697v1)
Published 13 May 2024 in cs.IT and math.IT
Abstract: This paper investigates practical coding schemes for Distributed Hypothesis Testing (DHT). While the literature has extensively analyzed the information-theoretic performance of DHT and established bounds on Type-II error exponents through quantize and quantize-binning achievability schemes, the practical implementation of DHT coding schemes has not yet been investigated. Therefore, this paper introduces practical implementations of quantizers and quantize-binning schemes for DHT, leveraging short-length binary linear block codes. Furthermore, it provides exact analytical expressions for Type-I and Type-II error probabilities associated with each proposed coding scheme. Numerical results show the accuracy of the proposed analytical error probability expressions, and enable to compare the performance of the proposed schemes.
- S. Amari et al., “Statistical inference under multiterminal data compression,” IEEE Transactions on Information Theory, vol. 44, no. 6, pp. 2300–2324, 1998.
- T. Berger, “Decentralized estimation and decision theory,” in IEEE Seven Springs Workshop on Information Theory, Mt. Kisco, NY, 1979.
- R. Ahlswede and I. Csiszár, “Hypothesis testing with communication constraints,” IEEE Transactions on Information Theory, vol. 32, no. 4, pp. 533–542, 1986.
- S. Watanabe, “On sub-optimality of random binning for distributed hypothesis testing,” in IEEE International Symposium on Information Theory (ISIT), 2022, pp. 2708–2713.
- H. Shimokawa and S. Amari, “Error bound of hypothesis testing with data compression,” in IEEE International Symposium on Information Theory (ISIT), 1994, p. 114.
- M. S. Rahman and A. B. Wagner, “On the optimality of binning for distributed hypothesis testing,” IEEE Transactions on Information Theory, vol. 58, no. 10, pp. 6282–6303, 2012.
- E. Haim and Y. Kochman, “Binary distributed hypothesis testing via Körner-Marton coding,” in IEEE Information Theory Workshop (ITW), 2016, pp. 146–150.
- G. Katz, P. Piantanida, R. Couillet, and M. Debbah, “On the necessity of binning for the distributed hypothesis testing problem,” in IEEE International Symposium on Information Theory (ISIT), 2015, pp. 2797–2801.
- I. S. Adamou, E. Dupraz, and T. Matsumoto, “An information-spectrum approach to distributed hypothesis testing for general sources,” in Accepted at the Internation Zurich Seminar (IZS), 2024.
- S. Sreekumar and D. Gündüz, “Distributed hypothesis testing over discrete memoryless channels,” IEEE Transactions on Information Theory, vol. 66, no. 4, pp. 2044–2066, 2019.
- S. Salehkalaibar and M. Wigger, “Distributed hypothesis testing over multi-access channels,” in IEEE Global Communications Conference (GLOBECOM), 2018, pp. 1–6.
- S. Salehkalaibar, M. Wigger, and L. Wang, “Hypothesis testing over the two-hop relay network,” IEEE Transactions on Information Theory, vol. 65, no. 7, pp. 4411–4433, 2019.
- S. Watanabe, “Neyman–pearson test for zero-rate multiterminal hypothesis testing,” IEEE Transactions on Information Theory, vol. 64, no. 7, pp. 4923–4939, 2017.
- J. Fridrich and T. Filler, “Binary quantization using belief propagation with decimation over factor graphs of ldgm codes,” in Proceedings of the 45th Allerton Conference on Coding, Communication, and Control, 2007, pp. 495–501.
- Z. Xiong, A. D. Liveris, and S. Cheng, “Distributed source coding for sensor networks,” IEEE Signal Processing Magazine, vol. 21, no. 5, pp. 80–94, 2004.
- M. J. Wainwright and E. Martinian, “Low-density graph codes that are optimal for binning and coding with side information,” IEEE Transactions on Information Theory, vol. 55, no. 3, pp. 1061–1079, 2009.
- M. C. Coşkun, G. Durisi, T. Jerkovits, G. Liva, W. Ryan, B. Stein, and F. Steiner, “Efficient error-correcting codes in the short blocklength regime,” Physical Communication, vol. 34, pp. 66–79, 2019.
- M. Gastpar, B. Rimoldi, and M. Vetterli, “To code, or not to code: Lossy source-channel communication revisited,” IEEE Transactions on Information Theory, vol. 49, no. 5, pp. 1147–1158, 2003.
- V. Chandar, E. Martinian, and G. W. Wornell, “Information embedding codes on graphs with iterative encoding and decoding,” in IEEE International Symposium on Information Theory (ISIT), 2006, pp. 866–870.