activity
20222026
most citedA new chaotic image encryption algorithm based on transversals in a Latin square

24 citations · 24 across the 4 of their papers we have counts for

collaborators

6 papers

math.CO2026

On the existence of mixed orthogonal arrays of strength two with six factors

Xiuling Shan, Guangzhou Chen, Xiangrong Sun

Orthogonal arrays are foundational objects in combinatorial design theory and experimental design theory, with broad applications in computer science, coding theory, and cryptograp…

quant-ph2026

Local unitary equivalence of orthogonal arrays and related linear codes

Miaomiao Zheng, Yajuan Zang, Xiuling Shan +1

Orthogonal arrays (OAs) are combinatorial configurations with applications in experimental design, error-correcting codes, and quantum information. Local unitary (LU) equivalence p…

cs.IT2026

Geometric construction of k-optimal locally repairable codes

Yi Fu, Xiuling Shan

A linear code is referred to as a locally repairable code (LRC) with locality r if any erased code symbol can be recovered by accessing at most r other code symbols. LRCs are highl…

math.CO2026

Constructions of two-dimensional optical orthogonal codes of weight three

Xiuling Shan, Lidong Wang, Yanxun Chang +1

The study of optical orthogonal codes has been motivated by an application in an optical code-division multiple access system. This paper focuses on optimal two-dimensional optical…

math.CO2025

On the cardinalities of quantum Latin squares

Yajuan Zang, Meihui Zheng, Zihong Tian +1

A quantum Latin square of order , QLS(), is a array in which each of entries is a unit column vector from the Hilbert space , such that every row…

cs.CR2022★ 24 cited

A new chaotic image encryption algorithm based on transversals in a Latin square

Honglian Shen, Xiuling Shan, Zihong Tian

There are some good combinatorial structures suitable for image encryption. In this study, a new chaotic image encryption algorithm based on transversals in a Latin square is propo…