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
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
## 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
## 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
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 asymptotic value as nPR of the number b(n) of inequivalent binary n-codes is determined. It was long known that b(n) also gives the number of nonisomorphic binary n-matroids.
## 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.