Bounds for binary codes relative to pseudo-distances of k points

15 years 2 months ago

Download www.math.u-bordeaux.fr

We apply Schrijver's semidefinite programming method to obtain improved upper bounds on generalized distances and list decoding radii of binary codes.

Christine Bachoc, Gilles Zémor

Real-time Traffic

Binary Codes | CORR 2010 | Education | Semidefinite Programming Method | Upper Bounds |

claim paper

» On the Decoding Complexity of Cyclic Codes Up to the BCH Bound

» maxcut and Containment Relations in Graphs

» Linear programming bounds for codes via a covering argument

» Deterministic Approximation Algorithms for the Nearest Codeword Problem

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2010
Where	CORR
Authors	Christine Bachoc, Gilles Zémor

Comments (0)

Sciweavers

Bounds for binary codes relative to pseudo-distances of k points

Binary Codes | CORR 2010 | Education | Semidefinite Programming Method | Upper Bounds |

Explore & Download

Productivity Tools

Sciweavers