𝔖 Bobbio Scriptorium
✦   LIBER   ✦

New Constructions of Covering Codes

✍ Scribed by Alexander A. Davydov

Book ID
110261559
Publisher
Springer
Year
2001
Tongue
English
Weight
95 KB
Volume
22
Category
Article
ISSN
0925-1022

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

New constructions for covering designs
New constructions for covering designs
✍ Daniel M. Gordon; Oren Patashnik; Greg Kuperberg πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 838 KB

A (v, k, t) covering design, or covering, is a family of k-subsets, called blocks, chosen from a wet, such that each t-subset is contained in at least one of the blocks. The number of blocks is the covering's size, and the minimum size of such a covering is denoted by C(v, k, t). This paper gives th

New upper bounds for binary covering cod
New upper bounds for binary covering codes
✍ Patric R.J. Γ–stergΓ₯rd; Markku K. Kaikkonen πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 755 KB
Constructing covering codes by tabu sear
Constructing covering codes by tabu search
✍ Patric R. J. Γ–stergΓ₯rd πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 135 KB

The problem of finding good covering codes in Hamming spaces is considered. Many different local search methods have been used to find packing codes (the dual problem), whereas practically all published results on searches for covering codes are based on simulated annealing. In this article tabu sea

Direct constructions of additive codes
Direct constructions of additive codes
✍ JΓΌrgen Bierbrauer πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 117 KB

## Abstract A code is __q^m^__‐ary __q__‐linear if its alphabet forms an __m__‐dimensional vector space over 𝔽~__q__~ and the code is linear over 𝔽~__q__~. These __additive codes__ form a natural generalization of linear codes. Our main results are direct constructions of certain families of additi