Results 241 to 250 of about 2,457,220 (279)
Some of the next articles are maybe not open access.
IEEE Annual Symposium on Foundations of Computer Science, 2020
Constructing quantum LDPC codes with a minimum distance that grows faster than a square root of the length has been a major challenge of the field. With this challenge in mind, we investigate constructions that come from high-dimensional expanders, in ...
Shai Evra, T. Kaufman, G. Zémor
semanticscholar +1 more source
Constructing quantum LDPC codes with a minimum distance that grows faster than a square root of the length has been a major challenge of the field. With this challenge in mind, we investigate constructions that come from high-dimensional expanders, in ...
Shai Evra, T. Kaufman, G. Zémor
semanticscholar +1 more source
Blind Recognition of LDPC Codes Over Candidate Set
IEEE Communications Letters, 2020Adaptive modulation and coding (AMC) techniques have attracted more attention recently because of flexible strategies and dynamic channel quality.
Zhaojun Wu +3 more
semanticscholar +1 more source
Design of optimal LDPC code for the system of GMSK concatenated with LDPC codes
2011 2nd International Conference on Control, Instrumentation and Automation (ICCIA), 2011This paper mainly concerns on the continuous phase modulation system of GMSK concatenated with LDPC codes. Decomposing GMSK signal into differential coding and PAM modulating manner, we analyze the iterative demodulating and decoding principle and design optimal LDPC codes based on EXIT chart.
Aimin Zhu, Senjie Yao, Xiaogang Huang
openaire +3 more sources
The rate of regular LDPC codes
IEEE International Symposium on Information Theory, 2003. Proceedings., 2003We 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érard D. Cohen, G. Miller
openaire +2 more sources
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
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 Ninth International Conference onCommunications Systems, 2004. ICCS 2004., 2004
Low-density parity-check (LDPC) codes are well known for their abilities to achieve near Shannon channel capacity limit and low decoding complexity compared with the turbo decoder. However, their encoding complexities grow with the square of the code length.
Zhang Qi, Ng Chun Sum
openaire +2 more sources
Low-density parity-check (LDPC) codes are well known for their abilities to achieve near Shannon channel capacity limit and low decoding complexity compared with the turbo decoder. However, their encoding complexities grow with the square of the code length.
Zhang Qi, Ng Chun Sum
openaire +2 more sources
Integrated Design of JSCC Scheme Based on Double Protograph LDPC Codes System
IEEE Communications Letters, 2019In this letter, an integrated design of joint source-channel coding scheme based on the double protograph low-density parity-check (DP-LDPC) codes is proposed.
Qiwang Chen +3 more
semanticscholar +1 more source
Design of Optimal LDPC Code for the System of MDPSK Concatenated with LDPC Codes
2009 International Conference on Communication Software and Networks, 2009The combined demodulating and decoding algorithm of the system of M-ary Differential Phase-Shift Keying (MDPSK) concatenated with Low-Density Parity Check Codes in AWGN channels is analyzed in this paper. Concentrating on the above algorithm, we propose a design method of optimal LDPC code based on Extrinsic Information Transfer Chart. Meanwhile, as an
Yao Senjie, Zhu Aimin
openaire +2 more sources
Rate-Adaptive Protograph LDPC Codes for Multi-Level-Cell NAND Flash Memory
IEEE Communications Letters, 2018The multi-level-cell (MLC) NAND flash memory exhibits a diversity of the raw bit error rate (BER) over different program/erase (P/E) cycles and different types of bits within a memory cell.
Pingping Chen, K. Cai, Shi Zheng
semanticscholar +1 more source
Design of LDPC Codes Based on Multipath EMD Strategies for Progressive Edge Growth
IEEE Transactions on Communications, 2016Low-density parity-check (LDPC) codes are capable of achieving excellent performance and provide a useful alternative for the high-performance applications. However, at medium to high signal-to-noise ratios, an observable error floor arises from the loss
Cornelius T. Healy, R. D. Lamare
semanticscholar +1 more source