Results 61 to 70 of about 69,988 (217)

Constructing Large Girth QC Protograph LDPC Codes Based on PSD-PEG Algorithm

open access: yesIEEE Access, 2017
For a given base graph, the lifted graph can be obtained by a copy-and-permute procedure. If the permutation is cyclic, the lifted graph corresponds to a quasi-cyclic (QC) protograph low-density parity-check (LDPC) code.
Xue-Qin Jiang   +3 more
doaj   +1 more source

Some variations of Tanner's construction for short length QC‐LDPC codes

open access: yesElectronics Letters, Volume 60, Issue 3, February 2024.
We propose a variation of Tanner's construction for quasi‐cyclic low‐density parity‐check codes in a way that allows us to use NON‐prime lifting sizes by using some arithmetic sequences instead of geometric sequences. We prove two theorems on the values of this lifting sizes so that the resulting code has girth at least 8.
Wonjun Kim   +3 more
wiley   +1 more source

Codificação LDPC para aplicações em códigos de barra 2D coloridos [PDF]

open access: yes, 2012
Tese (doutorado) - Universidade Federal de Santa Catarina, Centro Tecnológico, Programa de Pós-Graduação em Engenharia Elétrica, Florianópolis, 2011Nesta tese, aborda-se o armazenamento de informação em códigos de barra 2D coloridos, os quais devem ser ...
Legg, Andrei Piccinini
core  

Double-Hamming based QC LDPC codes with large minimum distance [PDF]

open access: yes, 2011
A new method using Hamming codes to construct base matrices of (J, K)-regular LDPC convolutional codes with large free distance is presented. By proper labeling the corresponding base matrices and tailbiting these parent convolutional codes to given ...
Kudryashov, Boris,   +12 more
core   +1 more source

Construction of Rate-Compatible Raptor-Like Quasi-Cyclic LDPC Code With Edge Classification for IDMA Based Random Access

open access: yesIEEE Access, 2019
Recently, rate-compatible raptor-like quasi-cyclic low-density parity-check (RL-QC-LDPC) codes, which are a typical class of multi-edge type LDPC codes with excellent performance and high flexibility, have been adopted in the technical specification of ...
Yushu Zhang   +3 more
doaj   +1 more source

Derived dynamic scheduling for belief propagation decoding of LDPC codes

open access: yesElectronics Letters, Volume 60, Issue 4, February 2024.
Our article introduces two innovative dynamic scheduling strategies, derived informed variable‐to‐check residual belief propagation and derived variable‐node and variable‐to‐check‐edge residual belief propagation, for low‐density parity‐check (LDPC) codes.
Xiaotian Xu, Hua Zhou, Jiayi Zhao
wiley   +1 more source

A Post-Quantum Digital Signature Scheme from QC-LDPC Codes [PDF]

open access: yes, 2022
We propose a novel post-quantum code-based digital signature algorithm whose security is based on the difficulty of decoding Quasi-Cyclic codes in systematic form, and whose trapdoor relies on the knowledge of a hidden Quasi-Cyclic Low-Density-Parity ...
Giovanni Tognolini   +2 more
core  

Energy‐Efficiency Maximization in Backscatter Communication‐Based Non‐Orthogonal Multiple Access System: Dinkelbach and Successive Convex Approximation Approaches

open access: yesIET Signal Processing, Volume 2024, Issue 1, 2024.
This paper investigates a backscatter communication (BackCom) based non‐orthogonal multiple access (NOMA) system in a multiple‐input and single‐output (MISO) scenario, where two decoding methods are deployed, including the sum‐capacity approach and QR decomposition.
Dingjia Lin   +4 more
wiley   +1 more source

Efficient and Scalable FPGA-Oriented Design of QC-LDPC Bit-Flipping Decoders for Post-Quantum Cryptography

open access: yesIEEE Access, 2020
Considering code-based cryptography, quasi-cyclic low-density parity-check (QC-LDPC) codes are foreseen as one of the few solutions to design post-quantum cryptosystems.
Davide Zoni   +2 more
doaj   +1 more source

A cyclic‐shift based method for counting cycles of quasi‐cyclic LDPC codes

open access: yesElectronics Letters, Volume 60, Issue 2, January 2024.
This paper presents some new necessary and sufficient conditions for the existence of cycles with arbitrary lengths and proposes a simple and novel method for counting cycles of QC‐LDPC codes based on the improved condition. Compared with the existing methods, the presented method is effective and feasible and can enumerate cycles of QC‐LDPC codes in a
Hengzhou Xu   +5 more
wiley   +1 more source

Home - About - Disclaimer - Privacy