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 construction method also builds a 2t error correcting code by augmenting the codes of smaller error correcting capabilities as check symbols. Existing construction methods are used to build these check symbols so that the length of the code word will be optimized
منابع مشابه
Error-correcting codes and Bh-sequences
We construct error-correcting (nonlinear) binary codes using a construction of Bose and Chowla in additive number theory. Our method extends a construction of Graham and Sloane for constant weight codes. The new codes improve 1028 of the 7168 best known h-error correcting codes of wordlength ≤ 512 with 1 ≤ h ≤ 14. We give asymptotical comparisons to shortened BCH codes.
متن کاملA Note on Bounded-Weight Error-Correcting Codes
This paper computationally obtains optimal bounded-weight, binary, error-correcting codes for a variety of distance bounds and dimensions. We compare the sizes of our codes to the sizes of optimal constant-weight, binary, error-correcting codes, and evaluate the di erences.
متن کاملA Generalization of the Parallel Error Correcting Codes by Allowing Some Random Errors
This paper generalizes parallel error correcting codes proposed by Ahlswede et al. over a new type of multiple access channel called parallel error channel. The generalized parallel error correcting codes can handle with more errors compared with the original ones. We show construction methods of independent and non-independent parallel error correcting codes and decoding methods. We derive som...
متن کاملNumerical Cubature Using Error-Correcting Codes
We present a construction for improving numerical cubature formulas with equal weights and a convolution structure, in particular equal-weight product formulas, using linear error-correcting codes. The construction is most effective in low degree with extended BCH codes. Using it, we obtain several sequences of explicit, positive, interior cubature formulas with good asymptotics for each fixed ...
متن کاملOn multiple insertion/Deletion correcting codes
We investigate binary, number-theoretic, bit insertion/deletion correcting codes as pioneered by Levenshtein. The weight spectra and Hamming distance properties of single insertion/deletion error-correcting codes are analyzed. These relationships are then extended to investigate codes that can correct multiple random insertions and deletions. From these relationships, new bounds are derived and...
متن کامل