Multi-dimensional parity-check codes for bursty channels
We examine a class of multi-dimensional parity-check (MDPC) codes that can be obtained
by generalizing the single parity-check code to multiple dimensions geometrically. We …
by generalizing the single parity-check code to multiple dimensions geometrically. We …
Results on punctured low-density parity-check codes and improved iterative decoding techniques
H Pishro-Nik, F Fekri - IEEE Transactions on Information …, 2007 - ieeexplore.ieee.org
This paper first introduces an improved decoding algorithm for low-density parity-check
(LDPC) codes over binary-input-output-symmetric memoryless channels. Then some …
(LDPC) codes over binary-input-output-symmetric memoryless channels. Then some …
Low-density parity-check codes with fast decoding convergence speed
X Ma, E Yang - International Symposium onInformation Theory …, 2004 - ieeexplore.ieee.org
In this paper, the design of low-density parity-check (LDPC) codes for binary erasure
channels (BEC) with less number of decoding iterations in the parallel message-passing …
channels (BEC) with less number of decoding iterations in the parallel message-passing …
Constructing low-density parity-check codes with circulant matrices
JW Bond, S Hui, H Schmidt - 1999 Information Theory and …, 1999 - ieeexplore.ieee.org
This is a report on the authors' ongoing effort to implement low-density parity-check codes
with iterative belief propagation decoding in a communication system. The system requires …
with iterative belief propagation decoding in a communication system. The system requires …
Design and analysis of low-density parity-check codes for block-fading channels
We solve the problem of designing powerful low-density parity-check (LDPC) codes with
iterative decoding for the block-fading channel. We present a new family of full-diversity …
iterative decoding for the block-fading channel. We present a new family of full-diversity …
Low-density parity-check codes with rates very close to the capacity of the q-ary symmetric channel for large q
A Shokrollahi, W Wang - … Symposium onInformation Theory …, 2004 - ieeexplore.ieee.org
Transmission of packets over computer networks is subject to packet-level errors, which
appear as" bursts" of bit-level errors and are not well modeled by memoryless binary …
appear as" bursts" of bit-level errors and are not well modeled by memoryless binary …
Low-density parity-check codes based on finite geometries: a rediscovery and new results
Y Kou, S Lin, MPC Fossorier - IEEE Transactions on …, 2001 - ieeexplore.ieee.org
This paper presents a geometric approach to the construction of low-density parity-check
(LDPC) codes. Four classes of LDPC codes are constructed based on the lines and points of …
(LDPC) codes. Four classes of LDPC codes are constructed based on the lines and points of …
Construction of low-density parity-check codes by superposition
J Xu, L Chen, L Zeng, L Lan… - IEEE Transactions on …, 2005 - ieeexplore.ieee.org
Construction of low-density parity-check codes by superposition Page 1 IEEE TRANSACTIONS
ON COMMUNICATIONS, VOL. 53, NO. 2, FEBRUARY 2005 243 Transactions Papers …
ON COMMUNICATIONS, VOL. 53, NO. 2, FEBRUARY 2005 243 Transactions Papers …
Iterative decoding of multi-dimensional concatenated single parity check codes
This paper is concerned with the decoding technique and performance of multi-dimensional
concatenated single-parity-check (SPC) code. A very efficient sub-optimal soft-in-soft-out …
concatenated single-parity-check (SPC) code. A very efficient sub-optimal soft-in-soft-out …
Low density parity check codes: Construction based on finite geometries
Y Kou, S Lin, MPC Fossorier - Globecom'00-IEEE. Global …, 2000 - ieeexplore.ieee.org
Low density parity check (LDPC) codes with iterative decoding based on belief propagation
(IDBP) achieve astonishing error performance close to the Shannon limit. Until now there …
(IDBP) achieve astonishing error performance close to the Shannon limit. Until now there …