Presentation 2005-09-27
A Relation between Erasure Correcting and Error Correcting of Low-Density Parity-Check Codes
Gou HOSOYA, Toshiyasu MATSUSHIMA, Shigeichi HIRASAWA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We propose a new iterative decoding algorithm of low-density parity-check codes. The proposed decoding algorithm has used a bipartite graph whose symbol nodes are clustered according to a received sequence of the codeword. The clustering procedure has used a decoding algorithm over the binary erasure channel which substitutes parity check equations of degree two. We compare decoding results and complexity of the proposed decoding algorithm with the sum-product decoding algorithm.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) low-density parity-check (LDPC) code / sum-product decoding algorithm
Paper # IT2005-53
Date of Issue

Conference Information
Committee IT
Conference Date 2005/9/20(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Theory (IT)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Relation between Erasure Correcting and Error Correcting of Low-Density Parity-Check Codes
Sub Title (in English)
Keyword(1) low-density parity-check (LDPC) code
Keyword(2) sum-product decoding algorithm
1st Author's Name Gou HOSOYA
1st Author's Affiliation Department of Industrial and Management Systems Engineering, School of Science and Engineering, Waseda University()
2nd Author's Name Toshiyasu MATSUSHIMA
2nd Author's Affiliation Department of Industrial and Management Systems Engineering, School of Science and Engineering, Waseda University
3rd Author's Name Shigeichi HIRASAWA
3rd Author's Affiliation Department of Industrial and Management Systems Engineering, School of Science and Engineering, Waseda University
Date 2005-09-27
Paper # IT2005-53
Volume (vol) vol.105
Number (no) 311
Page pp.pp.-
#Pages 5
Date of Issue