Subspace Decomposition of Coset Codes (2402.09673v1)
Abstract: A new method is explored for analyzing the performance of coset codes over the binary erasure wiretap channel (BEWC) by decomposing the code over subspaces of the code space. This technique leads to an improved algorithm for calculating equivocation loss. It also provides a continuous-valued function for equivocation loss, permitting proofs of local optimality for certain finite-blocklength code constructions, including a code formed by excluding from the generator matrix all columns which lie within a particular subspace. Subspace decomposition is also used to explore the properties of an alternative secrecy code metric, the chi squared divergence. The chi squared divergence is shown to be far simpler to calculate than equivocation loss. Additionally, the codes which are shown to be locally optimal in terms of equivocation are also proved to be globally optimal in terms of chi squared divergence.
- A. D. Wyner, “The wire-tap channel,” The Bell System Technical Journal, vol. 54, no. 8, pp. 1355–1387, 1975.
- S. Rezaei Aghdam, A. Nooraiepour, and T. M. Duman, “An overview of physical layer security with finite-alphabet signaling,” IEEE Communications Surveys an Tutorials, vol. 21, no. 2, pp. 1829–1850, 2019.
- M. Bloch, O. Günlü, A. Yener, F. Oggier, H. V. Poor, L. Sankar, and R. F. Schaefer, “An overview of information-theoretic security and privacy: Metrics, limits and applications,” IEEE Journal on Selected Areas in Information Theory, vol. 2, no. 1, pp. 5–22, 2021.
- W. K. Harrison, J. Almeida, M. R. Bloch, S. W. McLaughlin, and J. Barros, “Coding for secrecy: An overview of error-control coding techniques for physical-layer security,” IEEE Signal Processing Magazine, vol. 30, no. 5, pp. 41–50, Sept. 2013.
- M. R. Bloch, M. Hayashi, and A. Thangaraj, “Error-control coding for physical-layer secrecy,” Proceedings of IEEE, vol. 103, no. 10, pp. 1725–1746, Oct. 2015.
- H. Mahdavifar and A. Vardy, “Achieving the secrecy capacity of wiretap channels using polar codes,” IEEE Transactions on Information Theory, vol. 57, no. 10, pp. 6428–6443, 2011.
- A. Thangaraj, S. Dihidar, A. R. Calderbank, S. W. McLaughlin, and J.-M. Merolla, “Applications of LDPC codes to the wiretap channels,” IEEE Transactions on Information Theory, vol. 53, no. 8, pp. 2933–2945, Aug. 2007.
- A. Subramanian, A. T. Suresh, S. Raj, A. Thangaraj, M. Bloch, and S. McLaughlin, “Strong and weak secrecy in wiretap channels,” in 2010 6th International Symposium on Turbo Codes and Iterative Information Processing, 2010, pp. 30–34.
- M. R. Bloch and J. N. Laneman, “Strong secrecy from channel resolvability,” IEEE Transactions on Information Theory, vol. 59, no. 12, pp. 8077–8098, 2013.
- G. Durisi, T. Koch, and P. Popovski, “Toward massive, ultrareliable, and low-latency wireless communication with short packets,” Proceedings of the IEEE, vol. 104, no. 9, pp. 1711–1726, 2016.
- W. K. Harrison and M. R. Bloch, “Attributes of generators for best finite blocklength coset wiretap codes over erasure channels,” in 2019 IEEE International Symposium on Information Theory (ISIT), 2019, pp. 827–831.
- W. K. Harrison and M. R. Bloch, “On dual relationships of secrecy codes,” in 2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2018, pp. 366–372.
- W. K Harrison, D. Sarmento, J. P Vilela, and M. AC Gomes, “Analysis of short blocklength codes for secrecy,” EURASIP Journal on Wireless Communications and Networking, vol. 2018, no. 1, pp. 1–15, 2018.
- D. Hunn and W. K. Harrison, “Subspace decomposition of extreme-rate secrecy codes,” in 2022 IEEE International Symposium on Information Theory (ISIT), 2022, pp. 1235–1240.
- J. Pfister, M. A. C. Gomes, J. P. Vilela, and W. K. Harrison, “Quantifying equivocation for finite blocklength wiretap codes,” in 2017 IEEE International Conference on Communications (ICC), 2017, pp. 1–6.
- S. Al-Hassan, M. Z. Ahmed, and M. Tomlinson, “Secrecy coding for the wiretap channel using best known linear codes,” in Global Information Infrastructure Symposium - GIIS 2013, 2013, pp. 1–6.
- J. Bell, “Euler and the pentagonal number theorem,” 2005. [Online]. Available: https://arxiv.org/abs/math/0510054
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
