33 citations · 57 across the 13 of their papers we have counts for
13 papers
On the exact quantum chromatic number of generalized Johnson graphs
Gaojun Luo, Xiwang Cao, Shitao Li +1
The quantum chromatic number is a fundamental parameter in the study of nonlocal games, capturing the extent to which entanglement can improve performance in distributed tasks. In…
A Construction of Asymptotically Optimal Cascaded CDC Schemes via Combinatorial Designs
Yingjie Cheng, Gaojun Luo, Xiwang Cao +2
A coded distributed computing (CDC) system aims to reduce the communication load in the MapReduce framework. Such a system has nodes, input files, and Reduce functions.…
Sharper Asymptotically Optimal CDC Schemes via Combinatorial Designs
Yingjie Cheng, Gaojun Luo, Xiwang Cao +2
Coded distributed computing (CDC) was introduced to greatly reduce the communication load for MapReduce computing systems. Such a system has nodes, input files, and Red…
Minimal Linear Codes Constructed from partial spreads
W. Lu, X. Wu, X. W. Cao +2
Partial spread is important in finite geometry and can be used to construct linear codes. From the results in (Designs, Codes and Cryptography 90:1-15, 2022) by Xia Li, Qin Yue and…
Repair of Reed-Solomon Codes in the Presence of Erroneous Nodes
Stanislav Kruglik, Gaojun Luo, Wilton Kim +4
We consider the repair scheme of Guruswami-Wootters for the Reed-Solomon code and ask: can we correctly repair a failed node in the presence of erroneous nodes? Equivalently, we co…
Fractional revival on abelian Cayley graphs
Xiwang Cao, Gaojun Luo
Fractional revival, known as a quantum transport phenomenon, is essential for entanglement generation in quantum spin networks. The concept of fractional revival is a generalizatio…
How Much Entanglement Does a Quantum Code Need?
Gaojun Luo, Martianus Frederic Ezerman, Markus Grassl +1
In the setting of entanglement-assisted quantum error-correcting codes (EAQECCs), the sender and the receiver have access to pre-shared entanglement. Such codes promise better info…
Entanglement-Assisted and Subsystem Quantum Codes: New Propagation Rules and Constructions
Gaojun Luo, Martianus Frederic Ezerman, San Ling
This paper proposes new propagation rules on quantum codes in the entanglement-assisted and in quantum subsystem scenarios. The rules lead to new families of such quantum codes who…
New Interleaving Constructions of Asymptotically Optimal Periodic Quasi-Complementary Sequence Sets
Gaojun Luo, Martianus Frederic Ezerman, San Ling
The correlation properties of sequences form a focal point in the design of multiple access systems of communications. Such a system must be able to serve a number of simultaneous…
Three New Infinite Families of Optimal Locally Repairable Codes from Matrix-Product Codes
Gaojun Luo, Martianus Frederic Ezerman, San Ling
Locally repairable codes have become a key instrument in large-scale distributed storage systems. This paper focuses on the construction of locally repairable codes with -lo…
A new generalized inverse of matrices from core-EP decomposition
Kezheng Zuo, Yu Li, Gaojun Luo
A new generalized inverse for a square matrix , called CCE-inverse, is established by the core-EP decomposition and Moore-Penrose inverse . We prop…
Optimal repairing schemes for Reed-Solomon codes with alphabet sizes linear in lengths under the rack-aware model
Lingfei Jin, Gaojun Luo, Chaoping Xing
In modern practical data centers, storage nodes are usually organized into equally sized groups, which is called racks. The cost of cross-rack communication is much more expensive…
MDS codes with arbitrary dimensional hull and their applications
Gaojun Luo, Xiwang Cao
The hull of linear codes have promising utilization in coding theory and quantum coding theory. In this paper, we study the hull of generalized Reed-Solomon codes and extended gene…