most citedMDS Entanglement-Assisted Quantum Codes of Arbitrary Lengths and Arbitrary Distances

2 citations · 3 across the 8 of their papers we have counts for

collaborators
Showing cs.ITShow all

6 papers · 1 filter

cs.IT2022

Lattice Codes for Lattice-Based PKE

Shanxiang Lyu, Ling Liu, Cong Ling +2

Existing error correction mechanisms in lattice-based public key encryption (PKE) rely on either naive modulation or its concatenation with error correction codes (ECC). This paper…

cs.IT2022★ 1 cited

Generalized Singleton Type Upper Bounds

Hao Chen, Longjiang Qu, Chengju Li +2

In this paper, we give upper bounds on the sizes of list-decodable codes in the Hamming metric space from covering codes with the covering radius smaller than or equal to…

cs.IT2022

Linear MSRD codes with Various Matrix Sizes and Unrestricted Lengths

Hao Chen

A sum-rank-metric code attaining the Singleton bound is called maximum sum-rank distance (MSRD). MSRD codes have been constructed for some parameter cases. In this paper we constru…

cs.IT2022

On Hull-Variation Problem of Equivalent Linear Codes

Hao Chen

The intersection () of a linear code and its Euclidean dual (Hermitian dual ${\bf C}^…

cs.IT2022

Covering -Symbol Metric Codes and the Generalized Singleton Bound

Hao Chen

Symbol-pair codes were proposed for the application in high density storage systems, where it is not possible to read individual symbols. Yaakobi, Bruck and Siegel proved that the…

cs.IT2022

Strict Half-Singleton Bound, Strict Direct Upper Bound for Linear Insertion-Deletion Codes and Optimal Codes

Qinqin Ji, Dabin Zheng, Hao Chen +1

Insertion-deletion codes (insdel codes for short) are used for correcting synchronization errors in communications, and in other many interesting fields such as DNA storage, date a…