activity
20182021
most citedOptimal repairing schemes for Reed-Solomon codes with alphabet sizes linear in lengths under the rack-aware model

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

collaborators

5 papers

cs.IT2021

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…

cs.IT2021

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…

math.RA20202 cited

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…

cs.IT201911 cited

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…

cs.IT2018

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…