Results 11 to 20 of about 1,191 (179)

LDPC Codes on Balanced Incomplete Block Designs: Construction, Girth, and Cycle Structure Analysis [PDF]

open access: yesEntropy
In this paper, we investigate the cycle structure inherent in the Tanner graphs of low-density parity-check (LDPC) codes constructed from balanced incomplete block designs (BIBDs).
Hengzhou Xu   +4 more
doaj   +2 more sources

High performance short-block binary regular LDPC codes

open access: yesAlexandria Engineering Journal, 2018
LDPC code shows a good performance with long-block codes. However, certain channels are constrained to use short-block codes due to latency. Therefore, concatenated LDPC codes with iterative decoding is a good choice to get a good performance ...
Latifa Mostari, Abdelmalik Taleb-Ahmed
doaj   +3 more sources

Constructing LDPC Codes with Any Desired Girth [PDF]

open access: yesSensors, 2021
In wireless sensor networks, the reliability of communication can be greatly improved by applying low-density parity-check (LDPC) codes. Algorithms based on progressive-edge-growth (PEG) pattern and quasi-cyclic (QC) pattern are the mainstream approaches
Chaohui Gao   +3 more
doaj   +2 more sources

High Efficiency Continuous-Variable Quantum Key Distribution Based on ATSC 3.0 LDPC Codes [PDF]

open access: yesEntropy, 2020
Due to the rapid development of quantum computing technology, encryption systems based on computational complexity are facing serious threats. Based on the fundamental theorem of quantum mechanics, continuous-variable quantum key distribution (CVQKD) has
Kun Zhang   +4 more
doaj   +2 more sources

4-CYCLE FREE APM LDPC CODES WITH AN EXPLICIT CONSTRUCTION [PDF]

open access: yesJournal of Algebraic Systems, 2021
Recently, a class of low-density parity-check codes based on affine permutation matrices, called APM-LDPC codes, have been considered which have some advantages than quasi-cyclic (QC) LDPC codes in terms of minimum-distance, cycle distribution, and error-
Z. Gholami, M. Gholami
doaj   +1 more source

Block Markov superposition transmission of LDPC codes

open access: yesJournal of Information and Intelligence, 2023
In this paper, based on the block Markov superposition transmission (BMST) technique, we present a new class of coupled low-density parity-check (LDPC) codes for the transport block (TB)-based transmission to improve the error-correcting performance. For
Qianfan Wang, Kongjing Guo, Xiao Ma
doaj   +1 more source

The design of structured LDPC codes with algorithmic graph construction [PDF]

open access: yesBulletin of the Polish Academy of Sciences: Technical Sciences, 2022
Low-Density Parity-Check (LDPC) codes are among the most effective modern error-correcting codes due to their excellent correction performance and highly parallel decoding scheme.
Wojciech Sułek
doaj   +1 more source

Asymmetric quantum LDPC codes [PDF]

open access: yes2008 IEEE International Symposium on Information Theory, 2008
5 pages, 1 figure, 1 table, to appear in the Proceedings of the 2008 IEEE International Symposium on Information ...
Pradeep Kiran Sarvepalli   +2 more
openaire   +4 more sources

Optimizing quasi-cyclic spatially coupled LDPC codes by eliminating harmful objects

open access: yesEURASIP Journal on Wireless Communications and Networking, 2023
It is well known that some harmful objects in the Tanner graph of low-density parity-check (LDPC) codes have a negative impact on their error correction performance under iterative message-passing decoding.
Massimo Battaglioni   +4 more
doaj   +1 more source

Randomly Punctured LDPC Codes [PDF]

open access: yesIEEE Journal on Selected Areas in Communications, 2016
In this paper, we present a random puncturing analysis of low-density parity-check (LDPC) code ensembles. We derive a simple analytic expression for the iterative belief propagation (BP) decoding threshold of a randomly punctured LDPC code ensemble on the binary erasure channel (BEC) and show that, with respect to the BP threshold, the strength and ...
David G. M. Mitchell   +3 more
openaire   +4 more sources

Home - About - Disclaimer - Privacy