Bounds on the Covering Radius of Linear Codes

13 years 10 months ago

Download www.ece.umd.edu

Asymptotically bounding the covering radius in terms of the dual distance is a well-studied problem. We will combine the polynomial approach with estimates of the distance distribution of codes to derive new results for linear codes.

Alexei E. Ashikhmin, Alexander Barg

Real-time Traffic

Computer Graphics | Covering Radius | DCC 2002 | Dual Distance | Well-studied Problem |

claim paper

» Multicovering Bounds from Relative Covering Radii

» Lower Bounds for the Football Pool Problem for 7 and 8 Matches

» The Complexity of the Covering Radius Problem on Lattices and Codes

» New Set of Codes for the MaximumLikelihood Decoding Problem

» Explicit construction of a small epsilonnet for linear threshold functions

» Asymmetric Binary Covering Codes

» Bounds for the Multicovering Radii of ReedMuller Codes with Applications to Stream Ciphers

» Combinatorial bounds for list decoding

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2002
Where	DCC
Authors	Alexei E. Ashikhmin, Alexander Barg

Comments (0)

Sciweavers

Bounds on the Covering Radius of Linear Codes

Computer Graphics | Covering Radius | DCC 2002 | Dual Distance | Well-studied Problem |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers