Presentation 2009-03-10
An Efficient Method for Evaluating Max-Fractional Distance Based on A Primal Path-Following Interior Point Method
Makoto MIWA, Tadashi WADAYAMA, Ichi TAKUMI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The max-fractional distance of a binary linear code is deeply related to the performance of an linear programming (LP) decoder on the AWGN channel. In this paper, we propose an efficient algorithm for evaluating the max-fractional distance of LDPC codes. The proposed method is based on efficient interior point method for solving LP problems. By using the proposed algorithm, the max-fractional distance of length up to 4000 has been successfully obtained.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) LDPC codes / Linear Programming Decoding / Max-Fractional Distance / Interior-Point Method
Paper # IT2008-108,ISEC2008-166,WBS2008-121
Date of Issue

Conference Information
Committee ISEC
Conference Date 2009/3/2(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 Security (ISEC)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) An Efficient Method for Evaluating Max-Fractional Distance Based on A Primal Path-Following Interior Point Method
Sub Title (in English)
Keyword(1) LDPC codes
Keyword(2) Linear Programming Decoding
Keyword(3) Max-Fractional Distance
Keyword(4) Interior-Point Method
1st Author's Name Makoto MIWA
1st Author's Affiliation Nagoya Institute of Technology()
2nd Author's Name Tadashi WADAYAMA
2nd Author's Affiliation Nagoya Institute of Technology
3rd Author's Name Ichi TAKUMI
3rd Author's Affiliation Nagoya Institute of Technology
Date 2009-03-10
Paper # IT2008-108,ISEC2008-166,WBS2008-121
Volume (vol) vol.108
Number (no) 473
Page pp.pp.-
#Pages 7
Date of Issue