𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Unidirectional covering codes

✍ Scribed by Ostergard, P.R.J.; Seuranen, E.A.

Book ID
114639042
Publisher
IEEE
Year
2006
Tongue
English
Weight
214 KB
Volume
52
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Covering bounds for codes
Covering bounds for codes
✍ A.R Calderbank πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 268 KB
Asymmetric Binary Covering Codes
Asymmetric Binary Covering Codes
✍ Joshua N Cooper; Robert B Ellis; Andrew B Kahng πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 170 KB

An asymmetric binary covering code of length n and radius R is a subset C of the n-cube Q n such that every vector x 2 Q n can be obtained from some vector c 2 C by changing at most R 1's of c to 0's, where R is as small as possible. K þ ðn; RÞ is defined as the smallest size of such a code. We show

Ternary Covering Codes Derived from BCH
Ternary Covering Codes Derived from BCH Codes
✍ John C Cock; Patric R.J Γ–stergΓ₯rd πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 250 KB

It is shown how ternary BCH codes can be lengthened to get linear codes with covering radius 2. The family obtained has the ternary Golay code as its first code, contains codes with record-breaking parameters, and has a good asymptotic behavior. The ternary Golay code is further used to obtain short