:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Xiong, Haoran, Ye, Zicheng, Zhang, Huazi, Wang, Jun, Liu, Ke, Yin, Dawei, Wang, Guanghui, Yan, Guiying, Ma, Zhiming
Format:	Preprint
Published:	2023
Subjects:	Information Theory
Online Access:	https://arxiv.org/abs/2307.02737
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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)

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

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

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

Stitched Polar Codes
by: Li, Yuan, et al.
Published: (2025)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

New Bounds for Linear Codes with Applications
by: Lin, Liren, et al.
Published: (2025)

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

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

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

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