講演抄録/キーワード |
講演名 |
2008-09-12 15:10
Multi-Edge type LDPC Code Ensembles with Exponentially Few Codewords of Linear Small Weight ○Tomoharu Awano・Kenta Kasai(tokyo Inst. of Tech.)・Tomoharu Shibuya(Sophia Univ.)・Kohichi Sakaniwa(tokyo Inst. of Tech.) IT2008-37 |
抄録 |
(和) |
(まだ登録されていません) |
(英) |
Multi-edge type LDPC codes are introduced by Richardson and Urbanke, and they show examples of their ensembles have better performance than other known ensembles.
Orlitsky {\it et al}. derived the condition for irregular LDPC code ensembles with minimum distance linearly increasing in code length. Nakasendo {\it et al}. derived the condition that code ensembles have exponentially decreasing small linear weight codewords for two-edge type LDPC code ensembles which is simple example of multi-edge type LDPC code ensembles.
In this letter, we derive the condition for multi-edge type LDPC code
ensembles with exponentially decreasing small linear weight codewords. |
キーワード |
(和) |
/ / / / / / / |
(英) |
multi-edge type LDPC codes / weight distribution / growth rate / Hayman approximation / / / / |
文献情報 |
信学技報, vol. 108, no. 202, IT2008-37, pp. 99-104, 2008年9月. |
資料番号 |
IT2008-37 |
発行日 |
2008-09-04 (IT) |
ISSN |
Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 |
著作権に ついて |
技術研究報告に掲載された論文の著作権は電子情報通信学会に帰属します.(許諾番号:10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
PDFダウンロード |
IT2008-37 |