- Shuhui Yu, Lijun Ji. New construction of cyclic subspace codes via Sidon spaces. Cryptography and Communications, 18(2):663-675, March 2026.
- Muhiddin Uguz, Fatih Sulak, Ali Doganaksoy, Onur Koçak. RW-9: A family of random walk tests. Cryptography and Communications, 18(1):213-230, January 2026.
- Xing Lin. (1+ε )-optimal MDS codes: contacting any set of helper nodes smaller than n-1. Cryptography and Communications, 18(2):507-524, March 2026.
- Ana Salagean, Percy Reyes-Paredes. Bounds for the average degree-k monomial density of Boolean functions. Cryptography and Communications, 18(1):187-211, January 2026.
- Ana-Isabel Gómez, Domingo Gómez-Pérez, Verónica Requena. A computational approach for the study of linear complexity of shrunken sequences. Cryptography and Communications, 18(1):141-152, January 2026.
- Yutong Guo, Yubo Li 0002, Guanghua Gu, Xuehua Li. Construction of two-dimensional complementary array code sets with flexible array sizes. Cryptography and Communications, 18(2):591-607, March 2026.
- Qian Ma, Xiaoshan Kai, Shixin Zhu. A class of ternary LCD cyclic codes. Cryptography and Communications, 18(2):395-423, March 2026.
- Zuling Chang, Martianus Frederic Ezerman, Pinhui Ke, Qiang Wang 0012. New successor rules to efficiently produce exponentially many binary de Bruijn sequences. Cryptography and Communications, 18(1):125-140, January 2026.
- Yao Tian, Fang-Wei Fu 0001. Optimal array codes with hierarchical locality. Cryptography and Communications, 18(2):425-456, March 2026.
- Minjia Shi, Maolin Sun, Ferruh Özbudak, Patrick Solé. Generalized Boolean functions over Galois rings. Cryptography and Communications, 18(2):297-313, March 2026.