Density of constant radius normal binary covering codes
نویسندگان
چکیده
منابع مشابه
Density of normal binary covering codes
A binary code with covering radius R is a subset C of the hypercube Qn = {0, 1}n such that every x ∈ Qn is within Hamming distance R of some codeword c ∈ C, where R is as small as possible. For a fixed coordinate i ∈ [n], define C b , for b ∈ {0, 1}, to be the set of codewords with a b in the ith position. Then C is normal if there exists an i ∈ [n] such that for any v ∈ Qn, the sum of the Hamm...
متن کاملOn the covering radius of some binary cyclic codes
We compute the covering radius of some families of binary cyclic codes. In particular, we compute the covering radius of cyclic codes with two zeros and minimum distance greater than 3. We compute the covering radius of some binary primitive BCH codes over F2f , where f = 7, 8.
متن کاملAsymmetric Binary Covering Codes
An asymmetric binary covering code of length n and radius R is a subset C of the n-cube Qn such that every vector x ∈ Qn can be obtained from some vector c ∈ 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 K(n,R) ∈ Θ(2/n) for constant R, using an asymmetric sphere-covering bound and probabilistic methods. W...
متن کاملAsymptotic Minimum Covering Radius of Block Codes
In this paper, we restudy the covering radius of block codes from an information theoretic point of view by ignoring the combinatorial formulation of the problem. In the new setting, the formula of the statistically defined minimum covering radius, for which the probability mass of uncovered space by M spheres can be made arbitrarily small, is reduced to a minimization of a statistically define...
متن کاملOn the covering radius of codes
Designing a good error-correcting code is a packing problem. The corresponding covering problem has received much less attention: now the codewords must be placed so that no vector of the space is very far from the nearest codeword. The two problems are quite different, and with a few exceptions good packings, i.e. codes with a large minimal distance, are usually not especially good coverings. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2008
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.08.042