A Cutting Plane Method based on Redundant Rows for Improving Fractional Distance

Simple item page
dc.creatorMiwa, Makoto
dc.creatorWadayama, Tadashi
dc.creatorTakumi, Ichi
dc.date2008-07-17
dc.date.accessioned2026-07-07T09:50:56Z
dc.date.available2026-07-07T09:50:56Z
dc.descriptionIn 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 l1-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.
dc.description8 pages, To be presented at Turbo Coding 2008
dc.identifierhttps://arxiv.org/abs/0807.2701
dc.identifierhttp://arxiv.org/abs/0807.2701
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/165117
dc.subjectInformation Theory
dc.titleA Cutting Plane Method based on Redundant Rows for Improving Fractional Distance
dc.typetext

Files

Collections

arXiv