Abstract The need for fast communication has led to the introduction of 100 Gbps optics in local area networks (LANs). To avoid retransmission of corrupted packets, in some LANs, the CRC codes were replaced by Reed‐Solomon (RS) codes. Although this solution has met its primary goal, it has two drawbacks: first, the payload size was significantly reduced, and second, each network node had to be equipped with much more complex hardware, which increased the cost of the network. Starting from the fact that the vast majority of corrupted packets contain only single errors, in this paper, a simple strategy for error control in 100 Gbps optical LANs is presented. More precisely, instead of protecting the data with the CRC or RS codes, using integer codes is suggested that can correct single errors and detect two types of burst errors: l ‐bit burst errors within one b ‐bit byte and h ‐bit burst errors within two b ‐bit bytes (1 ≤ h < l < b ). Unlike the CRC or RS codes, the proposed ones use integer and lookup table operations, which are supported by all processors. In addition, the proposed codes can be interleaved without delay and without using any additional hardware. This feature allows the decoder not only to process larger data sets in parallel, but also to detect all double burst errors.

This article presents a class of integer codes that are suitable for use in optical computer networks in which the data are 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 make them suitable for software implementation. Second, depending on the application requirements, the proposed codes can be used as low-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.

In this study, the authors present a class of integer codes capable to correct single and double asymmetric errors within a codeword. The encoding/decoding procedures for these codes are extremely simple, whereas the error control algorithm resembles the routing process. Thanks to these features, the presented codes have a potential to be practically applied, especially in optical networks covering small areas.

This paper presents a class of integer codes that can correct any burst of length \le l within a b-bit byte. Their main advantages lie in linear complexity of encoding and decoding procedures, as well as in the fact that a look-up table-based error control procedure requires relatively small memory resources.