Upper bounds for constant weight error correcting codes
نویسندگان
چکیده
منابع مشابه
Upper bounds for constant-weight codes
Let ( ) denote the maximum possible number of codewords in an ( ) constant-weight binary code. We improve upon the best known upper bounds on ( ) in numerous instances for 24 and 12, which is the parameter range of existing tables. Most improvements occur for = 8 10 where we reduce the upper bounds in more than half of the unresolved cases. We also extend the existing tables up to 28 and 14. To...
متن کاملImproved Construction Methods for Error Correcting Constant Weight Codes
Two construction methods for t error correcting constant weight codes are developed. Both of these methods are improvements over the existing codes. One construction is recursive, which is based on the observation that a 2t error correcting code can be built by concatenating two t error correcting codes. This results in the reduction of code word length for higher t values. The other constructi...
متن کاملUpper Bounds for Constant - Weight
| Let A(n; d; w) denote the maximum possible number of codewords in an (n; d; w) constant-weight binary code. We improve upon the best known upper bounds on A(n; d; w) in numerous instances for n 6 24 and d 6 10, which is the parameter range of existing tables. Most improvements occur for d = 8; 10, where we reduce the upper bounds in more than half of the unresolved cases. We also extend the e...
متن کاملNew lower bounds for constant weight codes
with M (which is expected). However, as M increases beyond Ahstrart -Some new lower bounds are given for A(n,4, IV), the maximum number of codewords in a binary code of length n, min imum distance 4, and constant weight IV. In a number of cases the results significantly 1.0 improve on the best bounds previously known. h=O 1 .
متن کاملOn Bounded-Weight Error-Correcting Codes
This paper computationally obtains optimal bounded-weight, binary, errorcorrecting codes for a variety of distance bounds and dimensions. We compare the sizes of our codes to the sizes of optimal constant-weight, binary, errorcorrecting codes, and evaluate the differences.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1972
ISSN: 0012-365X
DOI: 10.1016/0012-365x(72)90027-1