LDPC code construction as a generalized concatenated code

2014 ◽  
Author(s):  
Igor Zhilin ◽  
Victor Zyablov
Keyword(s):  
Ldpc Code ◽  
Code Construction ◽  
Concatenated Code

LDPC Code Construction with Low Error Floor Based on the IPEG Algorithm

2007 ◽  
Vol 11 (7) ◽  
pp. 607-609 ◽  
Author(s):  
Sung-ha Kim ◽  
Joon-sung Kim ◽  
Dae-son Kim ◽  
Hong-yeop Song
Keyword(s):  
Ldpc Code ◽  
Error Floor ◽  
Code Construction

A Structured LDPC Code Construction for Efficient Encoder Design

2006 ◽  
Author(s):  
Jean-baptiste Dore ◽  
Marie-helene Hamon ◽  
Pierre Penard
Keyword(s):  
Ldpc Code ◽  
Code Construction

scholarly journals Overcoming Data Availability Attacks in Blockchain Systems: LDPC Code Design for Coded Merkle Tree

2021 ◽  
Author(s):  
Debarnab Mitra ◽  
Lev Tauz ◽  
Lara Dolecek
Keyword(s):  
Linear Programming ◽  
Ldpc Codes ◽  
Sampling Strategy ◽  
Ldpc Code ◽  
Probability Of Detection ◽  
Data Availability ◽  
Malicious Node ◽  
Code Construction ◽  
Stopping Sets ◽  
Stopping Set

<div>In blockchain systems, full nodes store the entire blockchain ledger and validate all transactions in the system by operating on the entire ledger. However, for better scalability and decentralization of the system, blockchains also run light nodes that only store a small portion of the ledger. In blockchain systems having a majority of malicious full nodes, light nodes are vulnerable to a data availability (DA) attack. In this attack, a malicious node makes the light nodes accept an invalid block by hiding the invalid portion of the block from the nodes in the system. Recently, a technique based on LDPC codes called Coded Merkle Tree (CMT) was proposed by Yu et al. that enables light nodes to detect a DA attack by randomly requesting/sampling portions of the block from the malicious node. However, light nodes fail to detect a DA attack with high probability if a malicious node hides a small stopping set of the LDPC code. To mitigate this problem, Yu et al. used well-studied techniques to design random LDPC codes with high minimum stopping set size. Although effective, these codes are not necessarily optimal for this application. In this paper, we demonstrate that a suitable co-design of specialized LDPC codes and the light node sampling strategy can improve the probability of detection of DA attacks. We consider different adversary models based on their computational capabilities of finding stopping sets in LDPC codes. For a weak adversary model, we devise a new LDPC code construction termed as the entropy-constrained PEG (EC-PEG) algorithm which concentrates stopping sets to a small group of variable nodes. We demonstrate that the EC-PEG algorithm coupled with a greedy sampling strategy improves the probability of detection of DA attacks. For stronger adversary models, we provide a co-design of a sampling strategy called linear-programming-sampling (LP-sampling) and an LDPC code construction called linear-programming-constrained PEG (LC-PEG) algorithm. The new co-design demonstrates a higher probability of detection of DA attacks compared to approaches proposed in earlier literature.</div>

scholarly journals Concatenated Coding for GNSS Signals in Urban Environments

2020 ◽  
Vol 10 (18) ◽  
pp. 6397
Author(s):  
Jing Ke ◽  
Xiaochun Lu ◽  
Xue Wang ◽  
Xiaofei Chen ◽  
Sheng Tang
Keyword(s):  
Error Correction ◽  
Additive White Gaussian Noise ◽  
Ldpc Codes ◽  
Ldpc Code ◽  
Satellite System ◽  
Urban Environments ◽  
Shadow Fading ◽  
Concatenated Coding ◽  
Concatenated Code ◽  
Global Navigation Satellite

This work investigated concatenated coding schemes for Global Navigation Satellite System (GNSS) signals in order to increase their error correction capability in urban environments. In particular, a serial concatenated code that combines an outer Reed–Solomon (RS) code with an inner low-density parity-check (LDPC) code was designed, and the performance was investigated over the land mobile satellite (LMS) channel for characterizing multipath and shadow fading in urban environments. The performance of the proposed concatenated coding scheme was compared to that of a B-CNAV1 message, in which two interleaved 64-ary LDPC codes were employed. The simulation results demonstrate that the proposed concatenated code can obtain a similar error correction performance to the two interleaved 64-ary LDPC codes in both the additive white Gaussian noise (AWGN) and LMS channels at a lower complexity level.

Layered Approx-Regular LDPC: Code Construction and Encoder/Decoder Design

2008 ◽  
Vol 55 (2) ◽  
pp. 572-585 ◽  
Author(s):  
Haibin Zhang ◽  
Jia Zhu ◽  
Huifeng Shi ◽  
Dawei Wang
Keyword(s):  
Ldpc Code ◽  
Code Construction ◽  
Decoder Design

Low-Area Reed Decoding in a Generalized Concatenated Code Construction for PUFs

2015 ◽  
Author(s):  
Matthias Hiller ◽  
Ludwig Kurzinger ◽  
Georg Sigl ◽  
Sven Muelich ◽  
Sven Puchinger ◽  
...  
Keyword(s):  
Code Construction ◽  
Low Area ◽  
Concatenated Code
Sign in / Sign up

Export Citation Format

Share Document