Results 31 to 40 of about 250 (178)
On the Girth of Tanner (3, 13) Quasi-Cyclic LDPC Codes
IEEE Access, 2019 Girth is an important structural property of low-density parity-check (LDPC) codes. Motivated by the works on the girth of Tanner (3, 5), (3, 7), (3, 11), and (5, 7) quasi-cyclic (QC) LDPC codes, we, in this paper, study the girth of Tanner (3, 13) QC ...
Hengzhou Xu +4 more
doaj +1 more source
Wireless Communications and Mobile Computing, Volume 2020, Issue 1, 2020., 2020 Free space optical (FSO) communication systems provide wireless line of sight connectivity in the unlicensed spectrum, and wireless optical communication achieves higher data rates compared to their radio frequency (RF) counterparts. FSO systems are particularly attractive for last mile access problem by bridging fiber optic backbone connectivity to RF
Ibrahima Gueye +7 more
wiley +1 more source
Complexity of statistical attacks on QC‐LDPC code‐based cryptosystems [PDF]
IET Information Security, 2020 Public‐key cryptosystems built on quasi‐cyclic (QC) low‐density parity‐check and moderate‐density parity‐check codes are promising candidates for post‐quantum cryptography, since they are characterised by compact keys and high algorithmic efficiency. The main issue with this kind of system is represented by the fact that, since the decoding procedure ...
Paolo Santini +2 more
openaire +2 more sources
A High Throughput Implementation of QC-LDPC Codes for 5G NR
IEEE Access, 2019 Quasi-cyclic low-density parity-check (QC-LDPC) codes are the choice for data channels in the fifth generation (5G) new radio (NR). At the transmitter side, code bits from the QC-LDPC encoder are delivered to the rate matcher.
Hao Wu, Huayong Wang
doaj +1 more source
Encoding of QC-LDPC Codes of Rank Deficient Parity Matrix
Journal of Engineering, 2016 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
An Efficient Construction Method for Quasi-Cyclic Low Density Parity Check Codes
IEEE Access, 2017 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
A Note on the Girth of (3, 19)-Regular Tanner’s Quasi-Cyclic LDPC Codes
IEEE Access, 2021 In this article, we study the cycle structure of (3, 19)-regular Tanner’s quasi-cyclic (QC) LDPC codes with code length $19p$ , where $p$ is a prime and $p\equiv 1~(\bmod ~57)$ , and transform the conditions for the existence of cycles of ...
Manjie Zhou +4 more
doaj +1 more source
Analisis Kinerja Jaringan 5G dengan Pengkodean QC-LDPC dan Polar
Jurnal ElkomikaABSTRAK Jaringan 5G telah menjadi penanda penting dalam evolusi teknologi nirkabel yang menawarkan kecepatan dan kinerja yang luar biasa untuk memenuhi kebutuhan konektivitas yang semakin meningkat.
RENI DYAH WAHYUNINGRUM +3 more
doaj +1 more source
Energies, 2023 The large number of inexpensive and energy-efficient terminals in IoT systems is one of the emerging elements of the recent landscape of information and communication technologies.
Jakub Hyla, Wojciech Sułek
doaj +1 more source
Classical channel bandwidth requirements in continuous variable quantum key distribution systems
IET Quantum Communication, Volume 5, Issue 4, Page 601-611, December 2024.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