Results 141 to 150 of about 10,016 (203)

Experimental composable key distribution using discrete-modulated continuous variable quantum cryptography. [PDF]

open access: yesLight Sci Appl
Hajomer AAE   +8 more
europepmc   +1 more source

Full Diversity Low-Density Parity-Check (LDPC) Codes for Block-Fading Channel

2023 International Conference on Electronics, Information, and Communication (ICEIC), 2023
Refereed/Peer-reviewed The main goal of this paper is to design full-diversity and outage achieving LDPC codes over block-fading channels under message passing decoding. This paper presents the derivation of the necessary properties of full diversity LDPC codes under message passing decoding over block-fading channel.
Rajan Kadel, Gottfried Lechner
openaire   +2 more sources

Low-density parity-check (LDPC) coded OFDM systems

IEEE 54th Vehicular Technology Conference. VTC Fall 2001. Proceedings (Cat. No.01CH37211), 2002
Orthogonal frequency division multiplexing (OFDM) is a very attractive technique for high-bit-rate data transmission in a multipath fading environment that causes intersymbol interference (ISI). There are many error-correcting codes applied to OFDM, convolutional codes, Reed-Solomon codes, turbo codes, and so on.
H. Futaki, T. Ohtsuki
openaire   +1 more source

Low-density parity-check code (LDPC) schemes with BICM

International Conference on Communication Technology Proceedings, 2003. ICCT 2003., 2004
LDPC codes are serious opponent of turbo codes. This paper presents LDPC schemes using bit-interleaving coded modulation (BICM), which can increase the spectral efficiency two or three times with little loss of power efficiency. And the decoding complexity is also addressed in this paper.
null Hai-Gang Zhang   +3 more
openaire   +1 more source

Low density parity check (LDPC) codes for optical data storage

International Symposium on Optical Memory and Optical Data Storage Topical Meeting, 2003
Low-density parity check (LDPC codes, first introduced by Gallager (1962), are error-correcting codes based on very sparse parity check matrices. Recently, in the wake of excellent performance of turbo codes, LDPC codes were rediscovered as another category of random codes approaching the Shannon capacity limit with practical decoding complexity ...
V. Bhagavatula   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy