Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Applicable Algebra in Engineering Communication and Computing

Construction and decoding of matrix-product codes from nested codes

Fernando Hernando, Kristine Lally, Diego Ruano

Published Oct 8, 2009• 58 citations
Publisher
DOI
10.1007/s00200-009-0113-5

Related papers

Optimal Quantum ( r , δ )-Locally Repairable Codes From Matrix-Product Codes

Meng Cao, Kun Zhou

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.

arXiv:2508.03597•IEEE Transactions on Information Theory•May 14, 2026•13 citations

A decoding algorithm for linear codes

Martin Bossert, F. Hergert

Lecture notes in computer science•Jan 1, 1986•2 citations

Decoding Methods for Linear Codes

Kenny Barrese

•Jun 4, 2008•0 citations

Construction of lattices from LDPC codes

Mohammad‐Reza Sadeghi, Banihashemit AH, Daniel Panario

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.

Conference proceedings - Canadian Conference on Electrical and Computer Engineering•Nov 12, 2004•2 citations

Learning to Construct Nested Polar Codes: An Attention-Based Set-to-Element Model

Yang Li, Zhitang Chen, Guochen Liu +2 more

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.

IEEE Communications Letters•Sep 20, 2021•18 citations

Suboptimal Decoding of Linear Codes

Ilya I. Dumer

Springer eBooks•Jan 1, 1993•9 citations
This paper studies optimal quantum (r,δ)(r,δ)(r,δ)-LRCs from matrix-product (MP) codes. We establish a necessary and sufficient condition for an MP code to be an optimal (r,δ)(r,δ)(r,δ)-LRC. Based on this, we present a characterization for optimal quantum (r,δ)(r,δ)(r,δ)-LRCs from MP codes with nested constituent codes, and also study optimal quantum (r,δ)(r,δ)(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,δ)(r,δ)(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.