Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

30

SIAMDM
2002

favoriteEmaildiscussreport

84views more SIAMDM 2002»

Multicovering Bounds from Relative Covering Radii

13 years 10 months ago

Multicovering Bounds from Relative Covering Radii

Download www.cs.uky.edu

The multicovering radii of a code are recently introduced natural generalizations of the covering radius measuring the smallest radius of balls around codewords that cover all m-tuples of vectors. In this paper we prove a new identity relating the multicovering radii of a code to a relativized notion of ordinary covering radius. This identity is used to prove new bounds on the multicovering radii of particular codes. 1

Iiro S. Honkala, Andrew Klapper

Real-time Traffic

Covering Radius | Radii | SIAMDM 2002 | Smallest Radius |

claim paper

Related Content

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

» A PTAS for a Disc Covering Problem Using WidthBounded Separators

» Recursive Lower Bounds on the Nonlinearity Profile of Boolean Functions and Their Applicat...

» Covering Number Bounds of Certain Regularized Linear Function Classes

» Size Bounds and Query Plans for Relational Joins

» Lagrangean duals and exact solution to the capacitated pcenter problem

» Lifetime and coverage guarantees through distributed coordinatefree sensor activation

» Word maps and spectra of random graph lifts

» Shortest path amidst disc obstacles is computable

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	2002
Where	SIAMDM
Authors	Iiro S. Honkala, Andrew Klapper

Comments (0)