Lingyu Diao, Zuling Chang, Shujie Wang. Efficient universal cycle constructions for k-permutations via concatenation trees. // Designs, Codes and Cryptography. – 2026. – DOI: 10.1007/s10623-026-01880-4. – URL: https://doi.org/10.1007/s10623-026-01880-4
Lingyu Diao, Zuling Chang, & Shujie Wang (2026). Efficient universal cycle constructions for k-permutations via concatenation trees. Designs, Codes and Cryptography. https://doi.org/10.1007/s10623-026-01880-4
Lingyu Diao, et al. “Efficient universal cycle constructions for k-permutations via concatenation trees.” Designs, Codes and Cryptography, 2026. doi:10.1007/s10623-026-01880-4.
@article{Diao2026,
title = {Efficient universal cycle constructions for k-permutations via concatenation trees},
author = {Diao, Lingyu and Chang, Zuling and Wang, Shujie},
journal = {Designs, Codes and Cryptography},
year = {2026},
doi = {10.1007/s10623-026-01880-4},
url = {https://doi.org/10.1007/s10623-026-01880-4}
}