A survey on protograph LDPC codes and their applications

Y Fang, G Bi, YL Guan, FCM Lau - … Communications Surveys & …, 2015 - ieeexplore.ieee.org
Low-density parity-check (LDPC) codes have attracted much attention over the past two
decades since they can asymptotically approach the Shannon capacity in a variety of data …

A survey on channel coding techniques for 5G wireless networks

K Arora, J Singh, YS Randhawa - Telecommunication Systems, 2020 - Springer
Although 4G (fourth generation) ie LTE (long term evolution) systems are now in use world-
wide. But today's 4G systems have some challenges left such as spectrum scarcity and …

NR: The new 5G radio access technology

S Parkvall, E Dahlman, A Furuskar… - IEEE Communications …, 2017 - ieeexplore.ieee.org
This article provides an overview of the technology components and capabilities of the New
Radio (NR) radio interface standard currently under development by 3GPP. NR will enable …

Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes

G Couteau, P Rindal, S Raghuraman - Annual International Cryptology …, 2021 - Springer
We put forth new protocols for oblivious transfer extension and vector OLE, called Silver, for
SILent Vole and oblivious transfER. Silver offers extremely high performances: generating …

[图书][B] Information theory, inference and learning algorithms

DJC MacKay - 2003 - books.google.com
Information theory and inference, often taught separately, are here united in one entertaining
textbook. These topics lie at the heart of many exciting areas of contemporary science and …

Design of capacity-approaching irregular low-density parity-check codes

TJ Richardson, MA Shokrollahi… - IEEE transactions on …, 2001 - ieeexplore.ieee.org
We design low-density parity-check (LDPC) codes that perform at rates extremely close to
the Shannon capacity. The codes are built from highly irregular bipartite graphs with …

Information theoretic security

Y Liang, HV Poor, S Shamai - Foundations and Trends® in …, 2009 - nowpublishers.com
The topic of information theoretic security is introduced and the principal results in this area
are reviewed. The basic wire-tap channel model is considered first, and then several specific …

Regular and irregular progressive edge-growth tanner graphs

XY Hu, E Eleftheriou, DM Arnold - IEEE transactions on …, 2005 - ieeexplore.ieee.org
We propose a general method for constructing Tanner graphs having a large girth by
establishing edges or connections between symbol and check nodes in an edge-by-edge …

Fountain codes

DJC MacKay - IEE Proceedings-Communications, 2005 - IET
Fountain codes are record-breaking sparse-graph codes for channels with erasures, such
as the internet, where files are transmitted in multiple small packets, each of which is either …

Finite-length analysis of low-density parity-check codes on the binary erasure channel

C Di, D Proietti, IE Telatar… - … on Information theory, 2002 - ieeexplore.ieee.org
In this paper, we are concerned with the finite-length analysis of low-density parity-check
(LDPC) codes when used over the binary erasure channel (BEC). The main result is an …