Results 131 to 140 of about 1,191 (179)

Composable free-space continuous-variable quantum key distribution using discrete modulation. [PDF]

Sci Adv
Jaksch K, Dirmeier T, Weiser Y, Richter S, Bayraktar Ö, Hacker B, Rößler C, Khan I, Petscharning S, Grafenauer T, Hentschel M, Ömer B, Pacher C, Kanitschar F, Upadhyaya T, Lin J, Lütkenhaus N, Leuchs G, Marquardt C.   +18 more
europepmc   +1 more source

Blind recognition of channel codes based on dual-branch feature fusion convolutional neural networks. [PDF]

Sci Rep
Ma Y, Lei Y, Liu C, Wang W, Teng F, Peng C, Jin H, Feng H, Zhang M, Pan Y.   +9 more
europepmc   +1 more source

Coding for channels with intermittent feedback and its security analysis. [PDF]

PLoS One
Yang J, Huang Q, Lin Y.
europepmc   +1 more source

Adaptive Learned Belief Propagation for Decoding Error-Correcting Codes. [PDF]

Entropy (Basel)
Tasdighi A, Yousefi M.
europepmc   +1 more source

End-to-End DAE-LDPC-OFDM Transceiver with Learned Belief Propagation Decoder for Robust and Power-Efficient Wireless Communication. [PDF]

Sensors (Basel)
Mohammed M, Çevik M.
europepmc   +1 more source

Deriving Good LDPC Convolutional Codes from LDPC Block Codes [PDF]

IEEE Transactions on Information Theory, 2011
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-varying LDPC convolutional codes from LDPC block codes and show how earlier proposed LDPC convolutional ...
Roxana Smarandache, Daniel Joseph Costello, Jr., Ali Emre Pusane   +2 more
exaly   +4 more sources

Some of the next articles are maybe not open access.

Related searches:

Irregular LDPC codes as concatenation of regular LDPC codes

IEEE Communications Letters, 2005
In this letter, the construction of irregular LDPC codes obtained by concatenating regular ones is considered. These codes are analyzed for the binary symmetric channel (BSC). It is shown via proper distribution evolution that such concatenated codes have in general a threshold value weaker (but not necessarily much different) than their unconstrained ...
Marc P. C. Fossorier, Nenad Miladinovic
openaire   +2 more sources

Overview of LDPC Codes

7th IEEE International Conference on Computer and Information Technology (CIT 2007), 2007
In light of the history of LDPC codes and relevant research advances in recent years, this paper probes into the encoding and decoding techniques related to this capacity-approaching error-correction technology. Besides the general expression as an equation, LDPC codes can also be examined with a Tanner graph.
Zongjie Tu, Shiyong Zhang
openaire   +2 more sources

The rate of regular LDPC codes

IEEE International Symposium on Information Theory, 2003. Proceedings., 2003
Summary: We find the rate of a typical code from the regular low-density parity-check (LDPC) ensemble. We then show that the rate of a code from the ensemble converges to the design rate in quadratic mean and almost surely.
G. Miller, Gérard D. Cohen
openaire   +2 more sources

An Improvement on LDPC Coded Queued Codes

IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference, 2008
The queued-code based on low-density parity-check (LDPC) codes, which exploit both the near Shannon-limit performance LDPC codes and the instantaneous channel state information (CSI), can provide excellent performance in the block fading channels. The existing work utilized the conventional random puncturing and repetition operation, which may lead to ...
Ming Jiang 0012, Chunming Zhao 0001, Enyang Xu, Xiaoqun Gong   +3 more
openaire   +1 more source