3 citations · 4 across the 6 of their papers we have counts for
8 papers · 1 filter
A new upper bound and optimal constructions of equi-difference conflict-avoiding codes on constant weight
Chun-e Zhao, Wenping Ma, Tongjiang Yan +1
Conflict-avoiding codes (CACs) have been used in multiple-access collision channel without feedback. The size of a CAC is the number of potential users that can be supported in the…
Optimal Ternary Linear Complementary Dual Codes
Liangdong Lu, Ruihu Li, Qiang Fu +2
Linear complementary dual (LCD) codes introduced by Massey are the codes whose intersections with their dual codes are trivial. It can help to improve the security of the informati…
Two families of Entanglement-assisted Quantum MDS Codes from cyclic Codes
Liangdong Lu, Wenping Ma, Ruihu Li +1
With entanglement-assisted (EA) formalism, arbitrary classical linear codes are allowed to transform into EAQECCs by using pre-shared entanglement between the sender and the receiv…
Two families of Entanglement-assisted quantum MDS codes from constacyclic codes
Liangdong Lu, Wenping Ma, Luobin Guo
Entanglement-assisted quantum error correcting codes (EAQECCs) can be derived from arbitrary classical linear codes. However, it is a very difficult task to determine the number of…
New Quantum MDS codes constructed from Constacyclic codes
Liangdong Lu, Wenping Ma, Ruihu Li +2
Quantum maximum-distance-separable (MDS) codes are an important class of quantum codes. In this paper, using constacyclic codes and Hermitain construction, we construct some new qu…
Entanglement-assisted quantum MDS codes from constacyclic codes with large minimum distance
Liangdong Lu, Wenping Ma, Ruihu Li +3
The entanglement-assisted (EA) formalism allows arbitrary classical linear codes to transform into entanglement-assisted quantum error correcting codes (EAQECCs) by using pre-share…