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

Radonjić, Aleksandar; Vujičić, Vladimir

doi:10.1007/s12095-019-00388-0

Cited by 8 publications

(2 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The error control procedure for the proposed codes is very similar to that from [9][10][11][12][13]. In short, after receiving corrupted packet (S ≠ 0), the decoder will look up the syndrome table (ST) to find the entry with the error correction data (Figure 2).…”

Section: Error Control Proceduresmentioning

confidence: 99%

Integer codes correcting single errors and detecting burst errors within two bytes

2023

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Error Control Proceduresmentioning

confidence: 99%

Integer codes correcting single errors and detecting burst errors within two bytes

2023

Self Cite

View full text Add to dashboard Cite

show abstract

“…]- [24] to find the entry where the first b bits match that of the syndrome S. After that, it will execute the operation(s):…”

Section: Error Correction Proceduresmentioning

confidence: 99%

Integer Codes Correcting Single Errors within Two Bytes

Radonjić

2021

J CIRCUIT SYST COMP

Self Cite

View full text Add to dashboard Cite

This paper presents a class of integer codes suitable for use in optical networks with low error rates. The presented codes are constructed with the help of a computer and have two important features: first, they can correct single errors affecting one or two [Formula: see text]-bit bytes, and second, they use processor-friendly operations to encode/decode data bits. The effectiveness of the presented codes is demonstrated on theoretical models of four-core and six-core processors. The obtained results show that the decoder throughput reaches 14.70[Formula: see text]Gbps, which is above the operating speed of 10G networks. Finally, the paper compares the proposed codes with BCH codes of similar properties. The comparison is made in terms of redundancy and the number of decoding operations.

show abstract

Unidirectional solid burst correcting integer codes

Pokhrel

Das

2021

J. Appl. Math. Comput.

View full text Add to dashboard Cite

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

Cited by 8 publications

References 17 publications

Integer codes correcting single errors and detecting burst errors within two bytes

Integer codes correcting single errors and detecting burst errors within two bytes

Integer Codes Correcting Single Errors within Two Bytes

Unidirectional solid burst correcting integer codes

Contact Info

Product

Resources

About