Results 21 to 30 of about 29,520 (201)
An Efficient Construction Method for Quasi-Cyclic Low Density Parity Check Codes
In this paper, we propose an optimized belief propagation (OBP) based progressive edge-growth (PEG) method for constructing quasi-cyclic low density parity check (QC-LDPC) codes. In this proposed method, Tanner graphs are built by progressively appending
Yiming Lei, Mingke Dong
doaj +1 more source
Multisource SWIPT-based coded cooperation:rate compatible codes and codeword splitting protocol
To achieve a high reliable and energy-saving green communication, we investigate a multisource simultaneous wireless information and power transfer (SWIPT)-based coded cooperation where the relay can realize information decoding and energy harvesting ...
Shunwai Zhang, Lingjun Kong, Jun Li
doaj +1 more source
Constructions of symplectic LCD MDS codes from quasi-cyclic codes
Linear complementary dual (LCD) codes play an important role in data storage, communications systems and cryptography. In this paper, we construct some symplectic LCD codes from quasi-cyclic (QC) codes, and prove that these symplectic LCD codes with ...
Xia Huang, Jin Li, Shan Huang
semanticscholar +1 more source
A construction of the high-rate regular quasi-cyclic LDPC codes
In this paper, a scheme to construct the high-rate regular quasi-cyclic low-density parity-check (QC-LDPC) codes is developed based on the finite geometry low-density parity-check (LDPC) codes.
Qi Meng +3 more
doaj +1 more source
Linking Reversed and Dual Codes of Quasi-Cyclic Codes
SUMMARY It is known that quasi-cyclic (QC) codes over the finite field F 𝑞 correspond to certain F 𝑞 [ 𝑥 ] -modules. A QC code C is specified by a generator polynomial matrix 𝐺 whose rows generate C as an F 𝑞 [ 𝑥 ] -module.
R. T. Eldin, H. Matsui
semanticscholar +1 more source
Constructing Large Girth QC Protograph LDPC Codes Based on PSD-PEG Algorithm
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
Constructing LDPC Codes with Any Desired Girth
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 +1 more source
Construction of multiple-rate QC-LDPC codes using hierarchical row-splitting [PDF]
In this letter, we propose an improved method called hierarchical row-splitting with edge variation for designing multiple-rate quasi-cyclic low-density parity-check (QC-LDPC) codes, which constructs lower-rate codes from a high-rate mother code by row ...
Wang, Qi, Wang, Zhaocheng, Zhao, Peiyao
core +1 more source
Ldpc Code Construction using Randomly Permutated Copies of Parity Check Matrix [PDF]
A construction technique is proposed for low-density parity check (LDPC) codes. It uses a base parity check matrix designed from a ran-dom or constructed construction method as Gallager or Quasi-Cyclic LDPC (QC-LDPC) codes in sequence to get codes with ...
Amr lulu, Ammar Abu-Hudrouss
doaj +1 more source
Deriving Good LDPC Convolutional Codes from LDPC Block Codes [PDF]
Low-density parity-check (LDPC) convolutional codes are capable of achieving excellent performance with low encoding and decoding complexity. In this paper we discuss several graph-cover-based methods for deriving families of time-invariant and time ...
Ali E. Pusane +4 more
core +1 more source

