𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Short codes with a given covering radius

✍ Scribed by Brualdi, R.A.; Pless, V.S.; Wilson, R.M.


Book ID
111934006
Publisher
IEEE
Year
1989
Tongue
English
Weight
937 KB
Volume
35
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


New Quaternary Linear Codes with Coverin
✍ 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

Upper Bounds on the Covering Radius of a
✍ S. Litsyn; A. TietΓ€vΓ€inen πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 235 KB

We derive new upper bounds on the covering radius of a binary linear code as a function of its dual distance and dual-distance width . These bounds improve on the Delorme -Sole Β΄ -Stokes bounds , and in a certain interval for binary linear codes they are also better than Tieta Β¨ va Β¨ inen's bound .

All binary codes with covering radius on
✍ Iiro Honkala πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 300 KB

Honkla, I., All binary codes with covering radius one are subnormal, Discrete Mathematics 94 (1991) 229-232. We prove that if a binary code hat; covering radius one then it is subnormal.