Integer codes correcting sparse byte errors

2020

IEEE Trans. VLSI Syst.

Self Cite

This paper presents a class of integer codes that are suitable for use in optical computer networks where the data is transmitted serially. The presented codes are constructed with the help of a computer and have three desirable properties. First, they use integer and lookup table operations, which makes them suitable for software implementation. Second, depending on the application requirements, the proposed codes can be used as lower rate error correction (EC) codes or as high-rate error detection (ED) codes. In the EC mode, which is suited for realtime applications, the receiver can correct all single and double errors as well as all triple-adjacent (TA) errors within one b-bit byte. On the other hand, if the integrity of data is of high importance, the receiver may operate in the ED mode. In that case, it is able to detect all quadruple errors, all double TA errors within one b-bit byte and all double TA errors within two b-bit bytes. Finally, it is important to note that the presented codes can be interleaved without delay and without using any additional hardware. Owing to this, it is possible to construct simple codes capable of detecting/correcting multiple TA and random errors.

Section: Introductionmentioning

confidence: 93%

Section: Error Control Proceduresmentioning

confidence: 99%

“…Without loss of generality, we will suppose that all nodes (computers, routers, etc.) are equipped with six-core processors having the same specifications as in [14] (Fig. 3a).…”

Section: Error Control Proceduresmentioning

confidence: 99%

Section: Error Control Proceduresmentioning

confidence: 99%

Section: Error Control Proceduresmentioning

confidence: 99%

See 3 more Smart Citations

Integer Codes Correcting Double Errors and Triple-Adjacent Errors Within a Byte

2020

IEEE Trans. VLSI Syst.

Self Cite

Logarithmic time encoding and decoding of integer error control codes

Vujičić

2023

Engineering Reports

Self Cite

One of the most important characteristics of all error control codes (ECCs) is the complexity of the encoding/decoding algorithms. Today, there are many ECCs that can correct multiple bit errors, but at the price of high encoding/decoding complexity. Among the rare exceptions are integer ECCs (IECCs), whose serial encoding/decoding algorithms run in O(n) time, where n is the codeword length. In this article, we show that IECCs can be encoded/decoded even faster, that is, that their parallel encoding/decoding algorithms have O(log2n) time complexity.

Integer codes correcting burst asymmetric within a byte and double asymmetric errors

Vujičić

2019

Cryptogr. Commun.

Self Cite

This paper presents a class of integer codes capable of correcting l-bit burst asymmetric errors within a b-bit byte (1 ≤ l < b) and double asymmetric errors within a codeword. The presented codes are constructed with the help of a computer and have the potential to be used in unamplified optical networks. In addition, the paper derives the upper bound on code length and shows that the proposed codes are efficient in terms of redundancy.