Turán-Theoretic Bounds on Several Elementary Trapping Sets in LDPC Codes
Fuente:
arXiv
Saved in:
| Main Authors: | Zhao, Ziyang, Xiong, Haoran, Ye, Zicheng, Yan, Guiying |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Theoretical Bounds for the Size of Elementary Trapping Sets by Graphic Methods
by: Xiong, Haoran, et al.
Published: (2023)
by: Xiong, Haoran, et al.
Published: (2023)
The Impact of the Distance Between Cycles on Elementary Trapping Sets
by: Xiong, Haoran, et al.
Published: (2025)
by: Xiong, Haoran, et al.
Published: (2025)
Linear Complexity Computation of Code Distance and Minimum Size of Trapping Sets for LDPC Codes with Bounded Treewidth
by: Peng, Qingqing, et al.
Published: (2025)
by: Peng, Qingqing, et al.
Published: (2025)
Improved Rate-versus-Distance Upper Bounds for LDPC Codes
by: Shangguan, Chong, et al.
Published: (2026)
by: Shangguan, Chong, et al.
Published: (2026)
On the lifting degree of girth-8 QC-LDPC codes
by: Xiong, Haoran, et al.
Published: (2024)
by: Xiong, Haoran, et al.
Published: (2024)
The Support Designs of Several Families of Lifted Linear Codes
by: Ding, Cunsheng, et al.
Published: (2024)
by: Ding, Cunsheng, et al.
Published: (2024)
LDPC Codes Achieve List Decoding Capacity
by: Mosheiff, Jonathan, et al.
Published: (2019)
by: Mosheiff, Jonathan, et al.
Published: (2019)
Bounds on Box Codes
by: Langberg, Michael, et al.
Published: (2025)
by: Langberg, Michael, et al.
Published: (2025)
New Correlation Bound and Construction of Quasi-Complementary Code Sets
by: Sarkar, Palash, et al.
Published: (2022)
by: Sarkar, Palash, et al.
Published: (2022)
PIR Codes, Unequal-Data-Demand Codes, and the Griesmer Bound
by: Hollmann, Henk D. L., et al.
Published: (2024)
by: Hollmann, Henk D. L., et al.
Published: (2024)
Fiber Bundle Codes: Breaking the $N^{1/2} \operatorname{polylog}(N)$ Barrier for Quantum LDPC Codes
by: Hastings, Matthew B., et al.
Published: (2020)
by: Hastings, Matthew B., et al.
Published: (2020)
Improved Johnson-type Bounds for Insertion-Deletion Codes
by: Yang, Yulin
Published: (2026)
by: Yang, Yulin
Published: (2026)
Upper Bounds on Multiple $b$-Burst Deletion-Correcting Codes
by: Wang, Chen, et al.
Published: (2026)
by: Wang, Chen, et al.
Published: (2026)
On the Performance of Low-complexity Decoders of LDPC Codes
by: Peng, Qingqing, et al.
Published: (2024)
by: Peng, Qingqing, et al.
Published: (2024)
Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds
by: Chen, Yeyuan, et al.
Published: (2024)
by: Chen, Yeyuan, et al.
Published: (2024)
Improved Upper Bound for the Size of a Trifferent Code
by: Bhandari, Siddharth, et al.
Published: (2024)
by: Bhandari, Siddharth, et al.
Published: (2024)
On the Weight Distribution of Weights Less than $2w_{\min}$ in Polar Codes
by: Ye, Zicheng, et al.
Published: (2023)
by: Ye, Zicheng, et al.
Published: (2023)
Stitched Polar Codes
by: Li, Yuan, et al.
Published: (2025)
by: Li, Yuan, et al.
Published: (2025)
On the Convergence Speed of Spatially Coupled LDPC Ensembles Under Window Decoding
by: Peng, Qingqing, et al.
Published: (2025)
by: Peng, Qingqing, et al.
Published: (2025)
Planar Turán number of two adjacent cycles
by: Song, Xinzhe, et al.
Published: (2024)
by: Song, Xinzhe, et al.
Published: (2024)
Absorbing Sets in Quantum LDPC Codes
by: Morris, Kirsten D., et al.
Published: (2023)
by: Morris, Kirsten D., et al.
Published: (2023)
Bounds on MLDR Codes Over ${\mathbb Z}_{p^t}$
by: Alderson, Tim L.
Published: (2024)
by: Alderson, Tim L.
Published: (2024)
High Throughput QC-LDPC Decoder With Optimized Schedule Policy in Layered Decoding
by: Chang, Dongxu, et al.
Published: (2025)
by: Chang, Dongxu, et al.
Published: (2025)
Outer Strong Blocking Sets
by: Alfarano, Gianira N., et al.
Published: (2023)
by: Alfarano, Gianira N., et al.
Published: (2023)
Gilbert-Varshamov Bound for Codes in $L_1$ Metric using Multivariate Analytic Combinatorics
by: Goyal, Keshav, et al.
Published: (2024)
by: Goyal, Keshav, et al.
Published: (2024)
On the Weight Spectrum of Rate-Compatible Polar Codes
by: Ye, Zicheng, et al.
Published: (2024)
by: Ye, Zicheng, et al.
Published: (2024)
Schubert Subspace Codes
by: Alfarano, Gianira N., et al.
Published: (2024)
by: Alfarano, Gianira N., et al.
Published: (2024)
Bounds on $k$-hash distances and rates of linear codes
by: Della Fiore, Stefano, et al.
Published: (2025)
by: Della Fiore, Stefano, et al.
Published: (2025)
Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles
by: Alrabiah, Omar, et al.
Published: (2024)
by: Alrabiah, Omar, et al.
Published: (2024)
Polynomials, Divided Differences, and Codes
by: Venkitesh, S.
Published: (2024)
by: Venkitesh, S.
Published: (2024)
The Eigenvalue Method in Coding Theory
by: Abiad, Aida, et al.
Published: (2025)
by: Abiad, Aida, et al.
Published: (2025)
Rank-metric codes over arbitrary fields: Bounds and constructions
by: Neri, Alessandro, et al.
Published: (2026)
by: Neri, Alessandro, et al.
Published: (2026)
Intersecting Codes and the Connectivity of $q$-Matroids
by: Conca, Fabrizio, et al.
Published: (2026)
by: Conca, Fabrizio, et al.
Published: (2026)
$t$-Balanced Codes with the Kendall-$τ$ Metric
by: Jany, Benjamin, et al.
Published: (2024)
by: Jany, Benjamin, et al.
Published: (2024)
The Service Rate Region of Hamming Codes
by: Choudhary, Priyanka, et al.
Published: (2025)
by: Choudhary, Priyanka, et al.
Published: (2025)
Bounds on Sphere Sizes in the Sum-Rank Metric and Coordinate-Additive Metrics
by: Couvée, Hugo Beeloo-Sauerbier, et al.
Published: (2024)
by: Couvée, Hugo Beeloo-Sauerbier, et al.
Published: (2024)
The constructions of Singleton-optimal locally repairable codes with minimum distance 6 and locality 3
by: Xiong, Yanzhen, et al.
Published: (2026)
by: Xiong, Yanzhen, et al.
Published: (2026)
Maximal Recoverability: A Nexus of Coding Theory
by: Brakensiek, Joshua, et al.
Published: (2026)
by: Brakensiek, Joshua, et al.
Published: (2026)
Binary Caps and LCD Codes with Large Dimensions
by: Ishizuka, Keita, et al.
Published: (2026)
by: Ishizuka, Keita, et al.
Published: (2026)
The Geometry of Codes for Random Access in DNA Storage
by: Gruica, Anina, et al.
Published: (2024)
by: Gruica, Anina, et al.
Published: (2024)
Similar Items
-
Theoretical Bounds for the Size of Elementary Trapping Sets by Graphic Methods
by: Xiong, Haoran, et al.
Published: (2023) -
The Impact of the Distance Between Cycles on Elementary Trapping Sets
by: Xiong, Haoran, et al.
Published: (2025) -
Linear Complexity Computation of Code Distance and Minimum Size of Trapping Sets for LDPC Codes with Bounded Treewidth
by: Peng, Qingqing, et al.
Published: (2025) -
Improved Rate-versus-Distance Upper Bounds for LDPC Codes
by: Shangguan, Chong, et al.
Published: (2026) -
On the lifting degree of girth-8 QC-LDPC codes
by: Xiong, Haoran, et al.
Published: (2024)