In addition to their applications in data storage, communications systems, and consumer
electronics, linear complementary dual (LCD) codes-a class of linear codes-have been …

One central theme in quantum error-correction is to construct quantum codes that have a
large minimum distance. Quantum maximal distance separable (MDS) codes are optimal in …

Most coding theory experts date the origin of the subject with the 1948 publication of A
Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has …

Quantum maximum-distance-separable (MDS) codes form an important class of quantum
codes. To get q-ary quantum MDS codes, one of the effective ways is to find linear MDS …

Let q be an odd prime power. Based on classical negacyclic codes, we construct two
classes of quantum maximum-distance-separable (MDS) codes with parameters [[q 2+ 1, q 2 …

Let p be an odd prime with p≠ 5. In this paper, we first provide the structures of repeated-
root cyclic codes of length 10 ps over finite fields F pm. We then give two methods of …

We address the problem of decoding sparse quantum error correction codes. For Pauli
channels, this task can be accomplished by a version of the belief propagation algorithm …

Historically, LCD cyclic codes were referred to as reversible cyclic codes, which had
applications in data storage. Due to a newly discovered application in cryptography, there …

The intersection () of a linear code and its Euclidean dual (Hermitian dual) is called the
Euclidean (Hermitian) hull of this code. It is natural to consider the hull-variation problem …

In this paper, we first construct several classes of classical Hermitian self-orthogonal
maximum distance separable (MDS) codes. Through these classical codes, we are able to …