Results 221 to 230 of about 143,981 (279)

On the pseudocodeword weight and parity-check matrix redundancy of linear codes

2007 IEEE Information Theory Workshop, 2007
The minimum pseudocodeword weight w min of a linear graph-based code is more influential in determining decoding performance when decoded via iterative and linear programming decoding algorithms than the classical minimum distance d min under standard maximum-likelihood decoding Moreover, unlike the minimum distance which is unique to the code ...
Christine A. Kelley, Deepak Sridhara
openaire   +2 more sources

Tiling parity-check matrix for reduced complexity high throughput low-density parity-check decoders

IEEE Workshop on Signal Processing Systems Design and Implementation, 2005., 2006
An approach for reducing hardware complexity of LDPC decoders is presented in this paper. Low-density parity-check (LDPC) codes have a sparse parity-check matrix (H matrix). In LDPC decoder, the H matrix is stored in memory and contains information about the parity check constraints. The approach presented in this paper constructs several sub-matrices (
A. Selvarathinam, null Gwan Choi
openaire   +1 more source

Optimizing the Parity Check Matrix for Efficient Decoding of RS-Based Cloud Storage Systems

IEEE International Parallel and Distributed Processing Symposium, 2019
In large scale distributed systems such as cloud storage systems, erasure coding is a fundamental technique to provide high reliability at low monetary cost.
Junqing Gu, Chentao Wu, Xin Xie, Han Qiu, Jie Li, M. Guo, Xubin He, Yuanyuan Dong, Yafei Zhao   +8 more
semanticscholar   +1 more source

Sparsity-Aware Medium-Density Parity-Check Decoder for McEliece Cryptosystems

IEEE Transactions on Circuits and Systems - II - Express Briefs, 2023
McEliece cryptosystem based on medium-density parity-check (MDPC) codes is one of the finalists for the post-quantum cryptography standard. Although decoder design for low-density parity-check (LDPC) codes used for digital communications is well ...
Xinmiao Zhang, Zhenshan Xie
semanticscholar   +1 more source

On Parity Check (0,1)-Matrix over $\mathbb{Z}_p$

SIAM Journal on Discrete Mathematics, 2015
The coin weighing problem asks to find \(m\) counterfeit coins (those with different weight) among \(n\) coins. The reconstructing graph from additive queries problem asks to reconstruct a graph \(G\), which is an unknown weighted graph with \(n\) vertices and at most \(m\) edges, from certain information.
Bshouty, Nader H., Mazzawi, Hanna
openaire   +1 more source

Low-Complexity Parallel Min-Sum Medium-Density Parity-Check Decoder for McEliece Cryptosystem

IEEE Transactions on Circuits and Systems Part 1: Regular Papers, 2023
The McEliece cryptosystem based on medium-density parity-check (MDPC) codes remains a candidate in the fourth round submission of post-quantum cryptography standard.
Jiaxuan Cai, Xinmiao Zhang
semanticscholar   +1 more source

The Q-matrix Low-Density Parity-Check codes

Journal of Electronics (China), 2006
This paper presents a matrix permuting approach to the construction of Low-Density Parity-Check (LDPC) code. It investigates the structure of the sparse parity-check matrix defined by Gallager. It is discovered that the problem of constructing the sparse parity-check matrix requires an algorithm that is efficient in search environments and also is able
Li Peng, Guangxi Zhu
openaire   +1 more source

Low-density parity-check codes with simple irregular semi-random parity-check matrix for finite-length applications

14th IEEE Proceedings on Personal, Indoor and Mobile Radio Communications, 2003. PIMRC 2003., 2004
In this paper, we consider the design of simple irregular low-density parity-check (LDPC) codes with semi-random parity-check matrix for good performance and fast encoding in practical applications with finite-length. We limit the number of degree-two variable nodes to satisfy the semi-random construction and then we optimize a simple irregular ...
M. Rashidpour, S.H. Jamali
openaire   +1 more source

Parity check matrix construction via Magic Square Based Algorithm

2012 International Symposium on Communications and Information Technologies (ISCIT), 2012
This paper presents a construction algorithm for the short block irregular LDPC codes. By applying a magic square theorem as a part of the matrix construction, a newly developed algorithm, the so-called Magic Square Based Algorithm (MSBA), is obtained.
Chutima Prasartkaew, Somsak Choomchuay
openaire   +1 more source

On Progressive Edge Growth Parity Check Matrix Generation for NB-LDPC Codes in HF Communications

2024 Systems of Signal Synchronization, Generating and Processing in Telecommunications (SYNCHROINFO)
This work explores the research and development of a Progressive Edge Growth (PEG) algorithm parameter setting method for the forming parity-check matrices of Low- density parity-check (LDPC) codes, which is an important task in the field of ...
E. M. Lobov, A. D. Grigorieva, V. Varlamov   +2 more
semanticscholar   +1 more source