Image de couverture de livre

Near-Codewords Aware Bit Flipping Decoding of QC-MDPC Codes

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Baldelli, Alessio, Baldi, Marco, De Zuane, Davide, Santini, Paolo
Format:	Preprint
Publié:	2026
Sujets:	Information Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

BF-Max: an Efficient Bit Flipping Decoder with Predictable Decoding Failure Rate
par: Baldelli, Alessio, et autres
Publié: (2025)

Design and Analysis of Quantum Dual-Containing CSS LDPC Codes based on Quasi-Dyadic Matrices
par: Baldelli, Alessio, et autres
Publié: (2026)

Implementation and transition to post-quantum cryptography of the Minimal IKE protocol
par: De Zuane, Davide, et autres
Publié: (2026)

Efficient Layered New Bit-Flipping QC-MDPC Decoder for BIKE Post-Quantum Cryptography
par: Cai, Jiaxuan, et autres
Publié: (2024)

Progressive-Proximity Bit-Flipping for Decoding Surface Codes
par: Pacenti, Michele, et autres
Publié: (2024)

Layered Normalized Min-Sum Decoding with Bit Flipping for FDPC Codes
par: Hosseinzadeh, Niloufar, et autres
Publié: (2025)

Collective Bit Flipping-Based Decoding of Quantum LDPC Codes
par: Chytas, Dimitris, et autres
Publié: (2024)

Soft-output Guessing Codeword Decoding
par: Duffy, Ken R., et autres
Publié: (2024)

On Constructing and Decoding Quantum Triorthogonal Codes
par: Baldelli, Alessio, et autres
Publié: (2026)

Quantum CSS LDPC Codes based on Dyadic Matrices for Belief Propagation-based Decoding
par: Baldelli, Alessio, et autres
Publié: (2026)

An Efficient Algorithm to Sample Quantum Low-Density Parity-Check Codes
par: Santini, Paolo
Publié: (2026)

A Low-Complexity Diversity-Preserving Universal Bit-Flipping Enhanced Hard Decision Decoder for Arbitrary Linear Codes
par: Bere, Praveen Sai, et autres
Publié: (2023)

Pseudoredundancy for the Bit-Flipping Algorithm
par: Zumbrägel, Jens
Publié: (2024)

On the Maximum Number of Codewords of X-Codes of Constant Weight Three
par: Tsunoda, Yu, et autres
Publié: (2019)

Using a Single-Parity-Check to Reduce the Guesswork of Guessing Codeword Decoding
par: Griffin, Joseph, et autres
Publié: (2024)

Successive-Cancellation Flip and Perturbation Decoder of Polar Codes
par: Pillet, Charles, et autres
Publié: (2025)

Scalable Syndrome-based Neural Decoders for Bit-Interleaved Coded Modulations
par: Rovella, Gastón De Boni, et autres
Publié: (2024)

Discovering the Unequal Importance of Coded Bits in the Decoding of Polar Codes
par: Hassan, Hossam, et autres
Publié: (2025)

On Reducing Decoding Complexity of Successive-Cancellation List Flip Decoding of Polar Codes
par: Pillet, Charles, et autres
Publié: (2026)

Guessing What, Noise or Codeword?
par: Ma, Xiao
Publié: (2024)

Partitioned Successive-Cancellation List Flip Decoding of Polar Codes
par: Pillet, Charles, et autres
Publié: (2024)

The Generating Idempotent Is a Minimum-Weight Codeword for Some Binary BCH Codes
par: Shany, Yaron, et autres
Publié: (2024)

Enumeration of Minimum Weight Codewords of Pre-Transformed Polar Codes by Tree Intersection
par: Zunker, Andreas, et autres
Publié: (2023)

Codeword Stabilized Codes from m-Uniform Graph States
par: Sudevan, Sowrabh, et autres
Publié: (2024)

High Throughput QC-LDPC Decoder With Optimized Schedule Policy in Layered Decoding
par: Chang, Dongxu, et autres
Publié: (2025)

Codeword-Segmentation Rate-Splitting Multiple Access and Evaluation under Suboptimal Decoding
par: Zhang, Sibo, et autres
Publié: (2025)

Generalized Restart Mechanism for Successive-Cancellation Flip Decoding of Polar Codes
par: Sagitov, Ilshat, et autres
Publié: (2025)

Reduction of Sufficient Number of Code Tables of $k$-Bit Delay Decodable Codes
par: Hashimoto, Kengo, et autres
Publié: (2024)

Marker+Codeword+Marker: A Coding Structure for Segmented Single-Insdel/-Edit Channels
par: Li, Zhen, et autres
Publié: (2024)

Efficient Algorithms for Constructing Minimum-Weight Codewords in Some Extended Binary BCH Codes
par: Berman, Amit, et autres
Publié: (2023)

Sharp Error-Rate Transitions in Quantum QC-LDPC Codes under Joint BP Decoding
par: Komoto, Daiki, et autres
Publié: (2025)

Balanced Low-Complexity and Flexible Error-Correction List Flip Decoding for Polar Codes
par: Lv, Yansong, et autres
Publié: (2023)

Successive-Cancellation Flip Decoding of Polar Codes Under Fixed Channel-Production Rate
par: Sagitov, Ilshat, et autres
Publié: (2024)

About Optimal Prefix Codes over Countably Infinite Alphabets: Probabilistic Intervals for the Codeword Lengths Assignment
par: Liu, Hongyang, et autres
Publié: (2026)

Optimal Binary Variable-Length Codes with a Bounded Number of 1's per Codeword: Design, Analysis, and Applications
par: Bruno, Roberto, et autres
Publié: (2025)

Block-MDS QC-LDPC Codes for Information Reconciliation in Key Distribution
par: Tauz, Lev, et autres
Publié: (2024)

Deep-Learning-Aided Successive Cancellation List Flip Decoding for Polar Codes
par: Liang, Fu-Siang, et autres
Publié: (2026)

Near-Optimal Generalized Decoding of Polar-like Codes
par: Yuan, Peihong, et autres
Publié: (2024)

Four-Dimensional Coded Modulation with Bit-wise Decoders for Future Optical Communications
par: Alvarado, Alex, et autres
Publié: (2014)

Explaining Robust Quantum Metrology by Counting Codewords
par: Novak, Oskar, et autres
Publié: (2025)