Journal Papers

  • Geyang Wang and Qi Wang, On the maximum size of variable-length non-overlapping codes, Designs, Codes and Cryptography, vol. 93, pp. 871–878, 2025. [paper] [arXiv]

  • Alexander Barg, Ohad Elishco, Ryan Gabrys, Geyang Wang, and Eitan Yaakobi, Storage codes and recoverable systems on lines and grids, Designs, Codes and Cryptography, vol. 92, pp. 4145–4168, 2024. [paper] [arXiv]

  • Geyang Wang and Qi Wang, On the size distribution of the fixed-length Levenshtein balls with radius one, Designs, Codes and Cryptography, vol. 92, pp. 2253–2265, 2024. [paper] [arXiv]

  • Geyang Wang and Qi Wang, Q-ary non-overlapping codes: a generating function approach, IEEE Transactions on Information Theory, vol. 68, no. 8, pp. 5154–5164, 2022. [paper] [arXiv]

Conference Proceedings

  • Geyang Wang, Alexander Barg, and Navin Kashyap, Recoverable systems as interaction models: a study by example, In 2025 IEEE International Symposium on Information Theory (ISIT), pp. 1–6, 2025. [paper]

  • Geyang Wang and Qi Wang, On the size distribution of Levenshtein balls with radius one, In 12th International Workshop on Coding and Cryptography, WCC 2022. [paper] [slides]

Preprints

  • Geyang Wang, Alexander Barg, and Navin Kashyap, Recoverable systems and the maximal hard-core model on the triangular lattice, 2026. [arXiv]

  • Geyang Wang, Alexander Barg, and Navin Kashyap, The maximal hard-core model as a recoverable system: Gibbs measures and phase coexistence, 2025. [arXiv]

Last updated: August 14, 2026