Title :
A cutting plane method based on redundant rows for improving fractional distance
Author :
Miwa, Makoto ; Wadayama, Tadashi ; Takumi, Ichi
Author_Institution :
Grad. Sch. of Eng., Nagoya Inst. of Technol., Nagoya
Abstract :
In this paper, an idea of the cutting plane method is employed to improve the fractional distance of a given binary parity check matrix. The fractional distance is the minimum weight (with respect to lscr1-distance) of vertices of the fundamental polytope. The cutting polytope is defined based on redundant rows of the parity check matrix and it plays a key role to eliminate unnecessary fractional vertices in the fundamental polytope. We propose a greedy algorithm and its efficient implementation for improving the fractional distance based on the cutting plane method.
Keywords :
decoding; greedy algorithms; linear codes; linear programming; matrix algebra; parity check codes; LDPC codes; binary parity check matrix; cutting plane method; density-parity check codes; fractional distance; greedy algorithm; linear programming decoding; Belief propagation; Decoding; Design methodology; Error correction; Greedy algorithms; Linear code; Linear programming; Parity check codes; Redundancy; Turbo codes;
Conference_Titel :
Turbo Codes and Related Topics, 2008 5th International Symposium on
Conference_Location :
Lausanne
Print_ISBN :
978-1-4244-2862-5
Electronic_ISBN :
978-1-4244-2863-2
DOI :
10.1109/TURBOCODING.2008.4658670