Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,397,757 papers from all fields of science
Search
Sign In
Create Free Account
Low-density parity-check code
Known as:
Gallager code
, Ldpc code
, LDPC
Expand
In information theory, a low-density parity-check (LDPC) code is a linear error correcting code, a method of transmitting a message over a noisy…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
49 relations
ATSC 3.0
BCH code
BCJR algorithm
Belief propagation
Expand
Broader (2)
Coding theory
Error detection and correction
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2005
2005
A 3.33Gb/s (1200,720) low-density parity check code decoder
Chien-Ching Lin
,
Kai-Li Lin
,
Hsie-Chia Chang
,
Chen-Yi Lee
Proceedings of the 31st European Solid-State…
2005
Corpus ID: 14702947
In this paper, a (1200,720) LDPC decoder based on an irregular parity check matrix is presented. For achieving higher chip…
Expand
Highly Cited
2005
Highly Cited
2005
Construction of low-density parity-check codes by superposition
Jun Xu
,
Lei Chen
,
L. Zeng
,
L. Lan
,
Shu Lin
IEEE Transactions on Communications
2005
Corpus ID: 22828362
This paper presents a superposition method for constructing low-density parity-check (LDPC) codes. Several classes of structured…
Expand
2005
2005
Simple reconfigurable low-density parity-check codes
G. Liva
,
E. Paolini
,
M. Chiani
IEEE Communications Letters
2005
Corpus ID: 5869428
Low-density parity-check codes (LDPCC) have been recently investigated as a possible solution for high data rate applications…
Expand
Highly Cited
2004
Highly Cited
2004
Near-Shannon-limit quasi-cyclic low-density parity-check codes
Lei Chen
,
Jun Xu
,
I. Djurdjevic
,
Shu Lin
IEEE Transactions on Communications
2004
Corpus ID: 45108712
This letter presents two classes of quasi-cyclic low-density parity-check codes that perform close to the Shannon limit.
Highly Cited
2004
Highly Cited
2004
Rate-compatible low-density parity-check codes
T. Tian
,
Christopher R. Jones
,
J. Villasenor
International Symposium onInformation Theory…
2004
Corpus ID: 19283861
Rate-compatible coding is appropriate for communication systems that experience a range of operating SNRs but seek to adhere to a…
Expand
Highly Cited
2004
Highly Cited
2004
Block-circulant low-density parity-check codes for optical communication systems
O. Milenkovic
,
I. Djordjevic
,
B. Vasic
IEEE Journal of Selected Topics in Quantum…
2004
Corpus ID: 5954821
A novel family of structured low-density parity-check (LDPC) codes with block-circulant parity-check matrices that consist of…
Expand
Highly Cited
2003
Highly Cited
2003
Low-density parity check codes and iterative decoding for long-haul optical communication systems
B. Vasic
,
I. Djordjevic
,
R. Kostuk
2003
Corpus ID: 10881499
A forward-error correction (FEC) scheme based on low-density parity check (LDPC) codes and iterative decoding using belief…
Expand
Highly Cited
2001
Highly Cited
2001
Parallel decoding architectures for low density parity check codes
C. Howland
,
A. Blanksby
ISCAS . The IEEE International Symposium on…
2001
Corpus ID: 40845807
A parallel architecture for decoding low density parity check (LDPC) codes is proposed that achieves high coding gain together…
Expand
Highly Cited
2000
Highly Cited
2000
Low density parity check codes for magnetic recording channels
Hongxin Song
,
R. Todd
,
J. R. Cruz
2000
Corpus ID: 17144277
We propose a system for magnetic recording, using a low density parity check (LDPC) code as the error-correcting-code, in…
Expand
Highly Cited
2000
Highly Cited
2000
Decoding low density parity check codes with finite quantization bits
L. Ping
,
Raymond W. K. Leung
IEEE Communications Letters
2000
Corpus ID: 2393426
This letter is concerned with the implementation issue of the sum-product algorithm (SPA) for decoding the low density parity…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE