Presentation 2010-01-07
A Note on Analysing LDPC Codes for Correcting a Burst Erasure
Gou HOSOYA, Toshiyasu MATSUSHIMA, Shigeichi HIRASAWA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) A lower bound on a probability of a burst erasure correction capability of regular low-density parity-check (LDPC) code ensemble under the belief-propagation decoding is investigated. This bound is based on the second moment method which expresses the upper bound on the minimum span for stopping sets of the regular LDPC code ensemble.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) low-density parity-check code / solid burst erasure / stopping set / minimum span / belief-propagation decoding
Paper # IT2009-52
Date of Issue

Conference Information
Committee IT
Conference Date 2009/12/31(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 ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Note on Analysing LDPC Codes for Correcting a Burst Erasure
Sub Title (in English)
Keyword(1) low-density parity-check code
Keyword(2) solid burst erasure
Keyword(3) stopping set
Keyword(4) minimum span
Keyword(5) belief-propagation decoding
1st Author's Name Gou HOSOYA
1st Author's Affiliation Department of Industrial and Management Systems Engineering, Faculty of Science and Engineering, Waseda University()
2nd Author's Name Toshiyasu MATSUSHIMA
2nd Author's Affiliation Department of Applied Mathematics, Faculty of Science and Engineering, Waseda University
3rd Author's Name Shigeichi HIRASAWA
3rd Author's Affiliation Waseda Research Institute of Science and Engineering, Waseda University
Date 2010-01-07
Paper # IT2009-52
Volume (vol) vol.109
Number (no) 357
Page pp.pp.-
#Pages 4
Date of Issue