Extended Bit-Flipping Algorithm for Solving Sparse Linear Systems of Equations Modulo p

被引：0

作者：

Abolpour, Asie ^{[1
]}

Sadeghi, Mohammad-Reza ^{[1
]}

Panario, Daniel ^{[2
]}

机构：

[1] Amirkabir Unvers Technol, Fac Math & Comp Sci, Hafez Ave, Tehran, Iran

[2] Carleton Univ, Sch Math & Stat, Ottawa, ON K1S 5B6, Canada

来源：

2011 IEEE INFORMATION THEORY WORKSHOP (ITW) | 2011年

关键词：

GF(2);

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Let p be a prime number. We propose a new method for solving sparse linear systems of equations modulo p when the coefficient matrix has column degree at most 2. This algorithm is based on a well-known decoding algorithm for Low-Density Parity-Check (LDPC) codes called bit-flipping (BF) algorithm. We modify and extend this hard-decision decoding algorithm. The complexity of this algorithm is linear in terms of the number of columns n and the number of nonzero coefficients w of the matrix. We give a detailed small example, and report on computational results for larger systems.

引用

页数：5