Cyclic Group Projection for Enumerating Quasi-Cyclic Codes Trapping Sets
Not on the map. Why?
Abstract (arXiv)
This paper introduces a novel approach to enumerate and assess Trapping sets in quasi-cyclic codes, those with circulant sizes that are non-prime numbers. Leveraging the quasi-cyclic properties, the method employs a tabular technique to streamline the importance sampling step for estimating the pseudo-codeword weight of Trapping sets. The presented methodology draws on the mathematical framework established in the provided theorem, which elucidates the behavior of projection and lifting transformations on pseudo-codewords
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 4 of its 21 references that are in the map. First posted on arXiv 26 Jan 2024.
Builds on
4 of 21 references.
References · 4
- 2016Interaction Screening: Efficient and Sample-Optimal Learning of Ising Modelscited by 43
- 2023Six Lectures on Linearized Neural Networkscited by 20
- 2021Perturb-and-max-product: Sampling and learning in discrete energy-based modelscited by 9
- 2023Spherical and Hyperbolic Toric Topology-Based Codes On Graph Embedding for Ising MRF Models: Classical and Quantum Topology Machine Learningcited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.