arXiv 1004.53672010-04cs.ITmath.IT

Multiplicatively Repeated Non-Binary LDPC Codes

Kenta Kasai, David Declercq, Charly Poulliat, Kohichi Sakaniwa

备注：: To appear in IEEE Transactions on Information Theory

英文摘要：

We propose non-binary LDPC codes concatenated with multiplicative repetition codes. By multiplicatively repeating the (2,3)-regular non-binary LDPC mother code of rate 1/3, we construct rate-compatible codes of lower rates 1/6, 1/9, 1/12,... Surprisingly, such simple low-rate non-binary LDPC codes outperform the best low-rate binary LDPC codes so far. Moreover, we propose the decoding algorithm for the proposed codes, which can be decoded with almost the same computational complexity as that of the mother code.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Fountain Codes with Multiplicatively Repeated Non-Binary LDPC Codes

We study fountain codes transmitted over the binary-input symmetric-output channel. For channels with small capacity, receivers needs to collects many channel outputs to recover information bits. Since a collected channel output yields a check node in the decoding Tanner graph, the channel with small capacity leads to large decoding complexity. In this paper, we introduce a novel fountain coding scheme with non-binary LDPC codes. The decoding complexity of the proposed fountain code does not depend on the channel. Numerical experiments show that the proposed codes exhibit better performance th…

2010-07-11cs.ITmath.IT

Design and Performance of Rate-compatible Non-Binary LDPC Convolutional Codes

In this paper, we present a construction method of non-binary low-density parity-check (LDPC) convolutional codes. Our construction method is an extension of Felstroem and Zigangirov construction for non-binary LDPC convolutional codes. The rate-compatibility of the non-binary convolutional code is also discussed. The proposed rate-compatible code is designed from one single mother (2,4)-regular non-binary LDPC convolutional code of rate 1/2. Higher-rate codes are produced by puncturing the mother code and lower-rate codes are produced by multiplicatively repeating the mother code. Simulation …

2011-06-19cs.ITmath.IT

采用乘法重复非二进制LDPC码的连续变量量子密钥分发高效信息协调

Efficient Reconciliation of Continuous Variable Quantum Key Distribution with Multiplicatively Repeated Non-Binary LDPC Codes

本研究提出基于乘法重复非二进制LDPC码的简易编码方案，用于连续变量量子密钥分发的信息协调，实现了192公里（标准光纤）和240公里（超低损耗光纤）的密钥提取距离，且码构造简单、具备码率自适应性并易于硬件实现。

2025-06-17cs.ITmath.ITquant-ph

Provably efficient instanton search algorithm for LP decoding of LDPC codes over the BSC

We consider Linear Programming (LP) decoding of a fixed Low-Density Parity-Check (LDPC) code over the Binary Symmetric Channel (BSC). The LP decoder fails when it outputs a pseudo-codeword which is not a codeword. We design an efficient algorithm termed the Instanton Search Algorithm (ISA) which, given a random input, generates a set of flips called the BSC-instanton. We prove that: (a) the LP decoder fails for any set of flips with support vector including an instanton; (b) for any input, the algorithm outputs an instanton in the number of steps upper-bounded by twice the number of flips in t…

2008-09-02cond-mat.stat-mechcs.ITmath.IT

量子LDPC码的随机构造

Random Construction of Quantum LDPC Codes

Institute of Science Tokyo（东京科学大学）

该研究提出一种保留CSS码矩阵行和列权重分布的局部修改方法，通过2×2交叉交换与整数线性规划修复构造随机量子LDPC码，修复复杂度与矩阵规模无关，可扩展至大型码块。

2026-08-17cs.ITmath.ITquant-ph

优质量子LDPC码的单次解码

Single-shot decoding of good quantum LDPC codes

本文证明量子Tanner码支持对抗性噪声下的单次量子纠错，串行与并行解码算法均适用，多轮纠错每轮仅需恒定时间解码，结合优良参数使其在量子容错协议中颇具潜力。

2024-04-11cs.ITmath.ITquant-ph

更多相关论文收起更多论文

Soft Syndrome Decoding of Quantum LDPC Codes for Joint Correction of Data and Syndrome Errors

Quantum errors are primarily detected and corrected using the measurement of syndrome information which itself is an unreliable step in practical error correction implementations. Typically, such faulty or noisy syndrome measurements are modeled as a binary measurement outcome flipped with some probability. However, the measured syndrome is in fact a discretized value of the continuous voltage or current values obtained in the physical implementation of the syndrome extraction. In this paper, we use this "soft" or analog information without the conventional discretization step to benefit the i…

2022-05-04cs.ITmath.ITquant-ph

基于校验节点不满足概率辅助的LDPC码动态分层译码调度

Dynamic Layered Decoding Scheduling for LDPC Codes Aided by Check Node Unsatisfied Probabilities

School of Mathematics, Shandong University（山东大学数学学院）；Academy of Mathematics and Systems Science, CAS, University of Chinese Academy of Sciences（中国科学院数学与系统科学研究院，中国科学院大学）；Tsinghua Shenzhen International Graduate School, Tsinghua University（清华大学深圳国际研究生院）

研究LDPC码分层置信传播译码更新顺序，提出基于校验节点不满足概率的动态调度方法，包括Dyn-EBP和Dyn-PEBP，在5G新无线电LDPC基图1码五次迭代中，相比仅基于信道概率调度能降低误块率，与其他调度方法有竞争力。

2026-07-21cs.ITmath.ITmath.OC

An Efficient Pseudo-Codeword Search Algorithm for Linear Programming Decoding of LDPC Codes

In Linear Programming (LP) decoding of a Low-Density-Parity-Check (LDPC) code one minimizes a linear functional, with coefficients related to log-likelihood ratios, over a relaxation of the polytope spanned by the codewords \cite{03FWK}. In order to quantify LP decoding, and thus to describe performance of the error-correction scheme at moderate and large Signal-to-Noise-Ratios (SNR), it is important to study the relaxed polytope to understand better its vertexes, so-called pseudo-codewords, especially those which are neighbors of the zero codeword. In this manuscript we propose a technique to…

2007-07-04cond-mat.dis-nncs.ITmath.IT

玻色量子LDPC码的模拟信息解码

Analog information decoding of bosonic quantum LDPC codes

本文提出利用玻色量子比特模拟综合征信息的新颖解码方法，适用于任意玻色码与QLDPC码的级联架构，并引入准单次协议及重叠窗口时域解码和模拟单次解码方法，显著减少重复综合征测量次数，为容错量子计算奠定基础。

2024-06-10cs.ITmath.ITquant-ph

New Results on the Pseudoredundancy

The concepts of pseudocodeword and pseudoweight play a fundamental role in the finite-length analysis of LDPC codes. The pseudoredundancy of a binary linear code is defined as the minimum number of rows in a parity-check matrix such that the corresponding minimum pseudoweight equals its minimum Hamming distance. By using the value assignment of Chen and Kløve we present new results on the pseudocodeword redundancy of binary linear codes. In particular, we give several upper bounds on the pseudoredundancies of certain codes with repeated and added coordinates and of certain shortened subcodes. …

2014-10-07cs.ITmath.IT

熵门：LLM流水线中用于近无损令牌压缩的熵淬火

Entropy Gate: Entropy Quenching for Near-Lossless Token Compression in LLM Pipelines

VIA Cybersecurity Lab, Kwame Nkrumah University of Science and Technology, Kumasi, Ghana（维亚网络安全实验室，卡布雷姆大学科学与技术学院，库马西，加纳）；Quantum and Assistive Technologies Lab, Kwame Nkrumah University of Science and Technology, Kumasi, Ghana（量子与辅助技术实验室，卡布雷姆大学科学与技术学院，库马西，加纳）

提出Entropy Gate框架，通过熵淬火（一种热力学过程）逐步冻结低信息令牌，实现40-60%压缩率且语义保真度高于0.80，并证明其接近信息论极限。

2026-06-02cs.CLcs.ITmath.IT