𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Classification of binary covering codes

✍ Scribed by Patric R. J. Östergård; William D. Weakley


Publisher
John Wiley and Sons
Year
2000
Tongue
English
Weight
147 KB
Volume
8
Category
Article
ISSN
1063-8539

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


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

Optimal binary covering codes of length
✍ William D. Weakley 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB

## Abstract The minimum size of a binary covering code of length __n__ and covering radius __r__ is denoted by __K__(__n__,__r__), and codes of this length are called optimal. For __j__ > 0 and __n__ = 2^__j__^, it is known that __K__(__n__,1) = 2 · __K__(__n__−1,1) = 2^__n − j__^. Say that two bin

An updated table of binary/ternary mixed
✍ Riccardo Bertolo; Patric R. J. Östergård; William D. Weakley 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB

## Abstract An updated table of __K__~2,3~(__b__,__t__;__R__)—the minimum cardinality of a code with __b__ binary coordinates, __t__ ternary coordinates, and covering radius __R__—is presented for __b__ + __t__ ≤ 13, __R__ ≤ 3. The results include new explanations of short binary and ternary coveri

Injury classification and the internatio
✍ Susan P. Baker 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 228 KB

Improvements in the widely used International Classification of Diseases (ICD) are important to our ability to study and prevent injuries. ICD "N codes" would be far more useful if they provided more detail, especially for internal injuries, and if they were modified to facilitate conversion to the

The construction of periodically time-va
✍ Naonori Ogasahara; Manabu Kobayashi; Shigeichi Hirasawa 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 483 KB

## Abstract In 1996 Rosenthal and York proposed (time‐invariant) BCH convolutional codes [4] in which the parity check matrix of a BCH code is used in the construction of the convolutional code. The lower bound on the minimum free distance of a BCH convolutional code is guaranteed by the BCH limit.