1 July 2020 in IEEE Transactions on Communications
Quantum secure direct communication (QSDC) is capable of direct confidential communications over a quantum channel, which is achieved by dispensing with the key agreement channel of the well-known quantum key distribution (QKD). However, to make QSDC a practical reality, we have to mitigate its reliance on quantum memory, its immediate communication interruption caused by eavesdropping and its low transmission reliability due to the heavy qubit losses. Hence a new QSDC protocol is proposed based on a sophisticated coded single-photon DL04 QSDC protocol to tackle the open challenges. In particular, quantum memory is dispensed with and a high-accuracy secrecy capacity estimate is derived for this protocol by conceiving dynamic joint encryption and error-control (JEEC) coding. We demonstrate that this quantum-memory-free DL04 QSDC (QMF-DL04 QSDC) protocol inches closer to the quantum channel's capacity and significantly improves the original DL04 QSDC's robustness. Moreover, a rate-compatible low-rate JEEC coding scheme is designed for the proposed framework, and the JEEC code advocated is shown to approach the secrecy capacity, despite tolerating an extremely high loss of qubits in the time-varying wiretap channel. Our simulations and experimental results demonstrate that the QMF-DL04 QSDC scheme significantly increases both the secure information rate and the communication distance of the original DL04 protocol.
18 October 2019 in IEEE Transactions on Communications
This paper analyzes and explicitly constructs quasi-cyclic (QC) codes for correcting multiple bursts via matrix transformations. Our analysis demonstrates that the multiple-burst-correction capability of QC codes is determined by sub-matrices in the diagonal of their transformed parity-check matrices. By well designing these sub-matrices, the proposed QC codes are able to achieve optimal or asymptotically optimal multiple-burst-correction capability. Moreover, it proves that these codes can be QC low-density parity-check (QC-LDPC) codes, if the diagonal sub-matrices of their transformed parity-check matrices are Hadamard powers of base matrices. Analysis and simulation results show that our QC-LDPC codes perform well over not only random symbol error/erasure channels, but also burst channels.
12 January 2026 in IEEE Wireless Communications Letters
This letter proposes to break trapping sets of the low-density parity-check (LDPC) codes used in an LDPC-coded modulation system that employs constant composition distribution matchers (CCDMs). By re-decoding a list of candidate input message vectors, obtained in terms of the double extension of unsatisfied check nodes (UCNs) or the weight constraint of CCDM codewords, the LDPC decoder may get out of the trapped state. As a result, the shaping decoder of CCDM may acquire more accurate input messages from the re-decoding process of LDPC code. Simulation results show that the proposed local re-decoding (LRD) algorithm can achieve better performance with reasonable computational overhead compared with other algorithms for decoding LDPC codes in the LDPC-coded modulation system.