A cutting plane method based on redundant rows for improving fractional distance
Miwa, M.
Wadayama, T.
Takumi, I.
Grad. Sch. of Eng., Nagoya Inst. of Technol., Nagoya;
This paper appears in: Turbo Codes and Related Topics, 2008 5th International Symposium on
Publication Date: 1-5 Sept. 2008
On page(s): 43-48
Location: Lausanne,
ISBN: 978-1-4244-2862-5
INSPEC Accession Number: 10368846
Digital Object Identifier: 10.1109/TURBOCODING.2008.4658670
Current Version Published: 2008-10-24
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.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
