Results 41 to 50 of about 256 (160)
Classical channel bandwidth requirements in continuous variable quantum key distribution systems
The reconciliation method for continuous variable quantum key distribution (CV‐QKD) systems is usually chosen based on its reconciliation efficiency. Nonetheless, one must also consider the requirements of each reconciliation method in terms of the amount of information transmitted on the classical channel. Such may limit the achievable key rates.
Margarida Almeida +3 more
wiley +1 more source
This paper undertakes a review and analysis of advanced channel coding techniques with the aim of their scalability towards B5G/6G networks scenario. A comparative study is presented for channel coding candidates of futuristic networks. Concatenated and derived codes of convolutional, polar, LDPC, Rateless, and Space‐time coding schemes are reviewed ...
Abhilasha Gautam +2 more
wiley +1 more source
Encoding of QC-LDPC Codes of Rank Deficient Parity Matrix
the encoding of long low density parity check (LDPC) codes presents a challenge compared to its decoding. The Quasi Cyclic (QC) LDPC codes offer the advantage for reducing the complexity for both encoding and decoding due to its QC structure.
Mohammed Kasim Mohammed Al-Haddad
doaj +2 more sources
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
Reordered static layered schedule for 5G low‐density parity‐check codes
A static layered schedule for the 5G low‐density parity‐check codes is proposed here. The proposed static layered schedule provides better error performance and faster convergence speed than state‐of‐the‐art. Abstract The error performance of the 5G low‐density parity‐check codes is significantly impacted by the update order of layers.
Yangcan Zhou, Zhongfeng Wang
wiley +1 more source
Some variations of Tanner's construction for short length QC‐LDPC codes
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
Tanner (3, 23)-Regular QC-LDPC Codes: Cycle Structure and Girth Distribution
This paper studies a class of quasi-cyclic LDPC (QC-LDPC) codes, i.e., Tanner (3, 23)-regular QC-LDPC codes of code length $23p$ with $p$ being a prime and $p \equiv 1 (\mathrm {mod} 69)$ .
Qi Wang +5 more
doaj +1 more source
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
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
Derived dynamic scheduling for belief propagation decoding of LDPC codes
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

