𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bounds on the Covering Radius of Linear Codes

✍ Scribed by A. Ashikhmin; A. Barg

Book ID
110392299
Publisher
Springer
Year
2002
Tongue
English
Weight
86 KB
Volume
27
Category
Article
ISSN
0925-1022

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the covering radius of cyclic linear
On the covering radius of cyclic linear codes and arithmetic codes
✍ Tor Helleseth πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 781 KB

The problem of finding the covering radius and minimum distance of algebraic and arithmetic codes is shown to be related to Waring's problem i n a finite field and to the theory of cyclotomic numbers. The methods devel oped l ead to new results for the covering radius of certain f-errorcorrecting BC

New Quaternary Linear Codes with Coverin
New Quaternary Linear Codes with Covering Radius 2
✍ Alexander A. Davydov; Patric R.J. Γ–stergΓ₯rd πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 123 KB

A new quaternary linear code of length 19, codimension 5, and covering radius 2 is found in a computer search using tabu search, a local search heuristic. Starting from this code, which has some useful partitioning properties, di!erent lengthening constructions are applied to get an in"nite family o

On the covering radius of Reed-Muller co
On the covering radius of Reed-Muller codes
✍ GΓ©rard D. Cohen; Simon N. Litsyn πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 371 KB

We present lower and upper bounds on the covering radius of Reed-Muller codes, yielding asymptotical improvements on known results. The lower bound is simply the sphere covering one (not very new). The upper bound is derived from a thorough use of a lemma, the 'essence of Reed-Mullerity'. The idea

On Lower Bounds For Covering Codes
On Lower Bounds For Covering Codes
✍ M. C. Bhandari; K. K. P. Chanduka; A. K. Lal πŸ“‚ Article πŸ“… 1998 πŸ› Springer 🌐 English βš– 78 KB