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

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

2008-07-17

arxiv.org/abs/0807.2701v1

Computer Science

Information Theory

8 pages, To be presented at Turbo Coding 2008

Scientific paper

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 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.

Affiliated with

Also associated with

No associations

Rating

A Cutting Plane Method based on Redundant Rows for Improving Fractional Distance does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Cutting Plane Method based on Redundant Rows for Improving Fractional Distance, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Cutting Plane Method based on Redundant Rows for Improving Fractional Distance will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-41978