This paper studies optimal quantum
(r,δ)-LRCs from matrix-product (MP) codes. We establish a necessary and sufficient condition for an MP code to be an optimal
(r,δ)-LRC. Based on this, we present a characterization for optimal quantum
(r,δ)-LRCs from MP codes with nested constituent codes, and also study optimal quantum
(r,δ)-LRCs constructed from MP codes with non-nested constituent codes. Through Hermitian dual-containing and Euclidean dual-containing MP codes, we present five infinite families of optimal quantum
(r,δ)-LRCs with flexible parameters.
Low-density parity-check (LDPC) codes can have a good performance under iterative decoding algorithms. This idea is used to construct a class of lattices with relatively high coding gain and low decoding complexity. To construct such lattices, Construction D' is applied to the set of parity check vectors of a class of nested LDPC codes. Bounds on the minimum distance and the coding gain of the corresponding lattice are provided. We also provide a practical way of finding the cross sections of the lattice given the parity check matrix of a lattice. The progressive edge growth algorithm is extended and is used to construct a class of nested binary codes to generate the corresponding lattice. Simulation results confirm the good performance of this class of lattice.
As capacity-achieving codes under successive cancellation (SC) decoding, nested polar codes have been adopted in 5G enhanced mobile broadband. To optimize the performance of the code construction under practical decoding, e.g. SC list (SCL) decoding, artificial intelligence based methods have been explored in the literature. However, the structure of nested polar codes has not been fully exploited for code construction. To address this issue, this letter transforms the original combinatorial optimization problem for the construction of nested polar codes into a policy optimization problem for sequential decision, and proposes an attention-based set-to-element model, which incorporates the nested structure into the policy design. Based on the proposed architecture for the policy, a gradient based algorithm for code construction and a divide-and-conquer strategy for parallel implementation are further developed. Simulation results demonstrate that the proposed construction outperforms the state-of-the-art nested polar codes for SCL decoding.