Integer codes correcting double asymmetric errors

Integer Codes Correcting Burst Asymmetric Errors Within a Byte

“…From this it is easy to show that, for practical data lengths up to 4096 bits, the proposed codes require one or two check-bits less than the codes from [11] (Table 4). The similar applies when comparing the proposed codes with integer codes capable of correcting l-bit burst errors within a b-bit byte [4]. In this case, for all values of l and K, except l = 3 and K = 512, the proposed codes require one or two check-bits less than the codes from [4].…”

“…The similar applies when comparing the proposed codes with integer codes capable of correcting l-bit burst errors within a b-bit byte [4]. In this case, for all values of l and K, except l = 3 and K = 512, the proposed codes require one or two check-bits less than the codes from [4].…”

“…To construct type-I and type-II integer B l/b AEC codes, it is necessary to know the integer values of both types of B l/b A errors. For that purpose, we will rely on the analysis from [4]. In that paper, it was shown that the integer value of a l-bit burst error within a b-bit byte is equal to…”

“…The first type of codes (type-I integer B l/b AEC codes) is designed to correct "negative" (1 → 0) B l/b A errors, while the second type of codes (type-II integer B l/b AEC codes) can correct "positive" (0 → 1) B l/b A errors. Like all other integer codes [4]- [11], the presented ones can be interleaved without delay and without using dedicated hardware. Owing to this, they can be transformed into simple codes capable of correcting (multiple) burst asymmetric (BA) errors.…”

Integer Codes Correcting Single Errors within Two Bytes

“… log ξ + 6 operations per K-bit data word [19], while the optimized DEC-BCH decoder performs 4•√K + 24 operations [31], [32] (Table 5). An additional drawback of DEC-BCH codes is that they use FF operations, which are not supported by modern processors.…”