Imagen de Portada

Theoretical Bounds for the Size of Elementary Trapping Sets by Graphic Methods

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Xiong, Haoran, Ye, Zicheng, Zhang, Huazi, Wang, Jun, Liu, Ke, Yin, Dawei, Wang, Guanghui, Yan, Guiying, Ma, Zhiming
Formato:	Preprint
Publicado:	2023
Materias:	Information Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

The Impact of the Distance Between Cycles on Elementary Trapping Sets
por: Xiong, Haoran, et al.
Publicado: (2025)

Turán-Theoretic Bounds on Several Elementary Trapping Sets in LDPC Codes
por: Zhao, Ziyang, et al.
Publicado: (2026)

Linear Complexity Computation of Code Distance and Minimum Size of Trapping Sets for LDPC Codes with Bounded Treewidth
por: Peng, Qingqing, et al.
Publicado: (2025)

On the Weight Distribution of Weights Less than $2w_{\min}$ in Polar Codes
por: Ye, Zicheng, et al.
Publicado: (2023)

On the lifting degree of girth-8 QC-LDPC codes
por: Xiong, Haoran, et al.
Publicado: (2024)

On the Weight Spectrum of Rate-Compatible Polar Codes
por: Ye, Zicheng, et al.
Publicado: (2024)

Stitched Polar Codes
por: Li, Yuan, et al.
Publicado: (2025)

An Optimization Model for Offline Scheduling Policy of Low-density Parity-check Codes
por: Chang, Dongxu, et al.
Publicado: (2023)

Achievability Bounds on Unequal Error Protection Codes
por: Yao, Liuquan, et al.
Publicado: (2024)

On the Performance of Low-complexity Decoders of LDPC Codes
por: Peng, Qingqing, et al.
Publicado: (2024)

Second-Order Identification Capacity of AWGN Channels
por: Liu, Zhicheng, et al.
Publicado: (2024)

Partial Orders in Rate-Matched Polar Codes
por: Liu, Zhichao, et al.
Publicado: (2024)

New Partial Orders of Polar Codes for BMSC
por: Yao, Liuquan, et al.
Publicado: (2024)

A Method to Reduce the Complexity of Computing the Complete Weight Distribution of Polar Codes
por: Liu, Zhichao, et al.
Publicado: (2024)

Coded Water-Filling for Multi-User Interference Cancellation
por: Li, Yuan, et al.
Publicado: (2024)

Density Evolution Analysis of Generalized Low-density Parity-check Codes under a Posteriori Probability Decoder
por: Chang, Dongxu, et al.
Publicado: (2024)

On the Convergence Speed of Spatially Coupled LDPC Ensembles Under Window Decoding
por: Peng, Qingqing, et al.
Publicado: (2025)

High Throughput QC-LDPC Decoder With Optimized Schedule Policy in Layered Decoding
por: Chang, Dongxu, et al.
Publicado: (2025)

Analysis of Efficient Scheduling in Layered Decoding of GLDPC Codes
por: Peng, Qingqing, et al.
Publicado: (2026)

Achieving the Fundamental Limit of Lossless Analog Compression via Polarization
por: Yuan, Shuai, et al.
Publicado: (2023)

Theoretical Analyses of Detectors for Additive Noise Channels with Mean-Variance Uncertainty under Nonlinear Expectation Theory
por: Lang, Wen-Xuan, et al.
Publicado: (2026)

Performance Analysis of Perturbation-enhanced SC decoders
por: Liu, Zhicheng, et al.
Publicado: (2025)

Set Size Bound for Aperiodic Z-Complementary Sets
por: Pai, Cheng-Yu, et al.
Publicado: (2024)

Adaptive Perturbation Enhanced SCL Decoder for Polar Codes
por: Wang, Xianbin, et al.
Publicado: (2024)

Beyond 1$\to$N Decoding: Capacity-Aware Rateless Polar Codes for IR-HARQ
por: Zhang, Huazi, et al.
Publicado: (2026)

Modified OSD Algorithm with Reduced Gaussian Elimination
por: Fossorier, Marc, et al.
Publicado: (2024)

Union Bound Analysis for Spin-Torque Transfer Magnetic Random Access Memory (STT-MRAM) With Channel Quantization
por: Zhong, Xingwei, et al.
Publicado: (2024)

Feedback Does Not Increase the Capacity of Approximately Memoryless Surjective POST Channels
por: Zhang, Xiaojing, et al.
Publicado: (2026)

On automorphism groups of polar codes
por: Ma, Jicheng, et al.
Publicado: (2024)

Dynamic Layered Decoding Scheduling for LDPC Codes Aided by Check Node Error Probabilities
por: Jia, Chenyuan, et al.
Publicado: (2025)

New Upper Bounds for Noisy Permutation Channels
por: Feng, Lugaoze, et al.
Publicado: (2024)

Improved Field Size Bounds for Higher Order MDS Codes
por: Brakensiek, Joshua, et al.
Publicado: (2022)

Information-Theoretic Fairness with A Bounded Statistical Parity Constraint
por: Zamani, Amirreza, et al.
Publicado: (2025)

MSR Codes with Linear Field Size and Smallest Sub-packetization for Any Number of Helper Nodes
por: Li, Guodong, et al.
Publicado: (2023)

A Direct Construction of 2D-CCC with Arbitrary Array Size and Flexible Set Size Using Multivariable Function
por: Ghosh, Gobinda, et al.
Publicado: (2022)

Cyclic Group Projection for Enumerating Quasi-Cyclic Codes Trapping Sets
por: Usatyuk, Vasiliy, et al.
Publicado: (2024)

Join Size Bounds using Lp-Norms on Degree Sequences
por: Khamis, Mahmoud Abo, et al.
Publicado: (2023)

Channel-Aware Optimal Transport: A Theoretical Framework for Generative Communication
por: Qu, Xiqiang, et al.
Publicado: (2024)

On the Maximum Size of Codes Under the Damerau-Levenshtein Metric
por: Ye, Zuo, et al.
Publicado: (2025)

Efficient DPF-based Error-Detecting Information-Theoretic Private Information Retrieval Over Rings
por: Ke, Pengzhen, et al.
Publicado: (2026)