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 b-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.70Gbps, 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 decodin...
In most communication networks, error probabilities 1 → 0 and 0 → 1 are equally likely to occur. How...
In public optical networks, the data are scrambled with a xu + 1 self-synchronous scramblers (SSSs)....
In most communication networks, error probabilities 1 → 0 and 0 → 1 are equally likely to occur. How...
This article presents a class of integer codes that are suitable for use in optical computer network...
This article presents a class of integer codes that are suitable for use in optical computer network...
In public optical networks, the data are scrambled with a xu + 1 self-synchronous scramblers (SSSs)....
In optical networks without optical amplifiers, the number of received photons never exceeds the num...
In optical networks without optical amplifiers, the number of received photons never exceeds the num...
In most communication networks, error probabilities 1 → 0 and 0 → 1 are equally likely to occur. How...
This paper presents two classes of integer codes that are suitable for use in local area networks. T...
In short-range optical networks, channel errors occur due to energy losses. Upon transmission, they ...
In short-range optical networks, channel errors occur due to energy losses. Upon transmission, they ...
This paper presents a class of integer codes capable of correcting l-bit burst asymmetric errors wit...
Correcting single and detecting adjacent errors has become important in memory systems using high de...
In this paper, we present a class of integer codes capable of correcting burst asymmetric errors. Th...
In most communication networks, error probabilities 1 → 0 and 0 → 1 are equally likely to occur. How...
In public optical networks, the data are scrambled with a xu + 1 self-synchronous scramblers (SSSs)....
In most communication networks, error probabilities 1 → 0 and 0 → 1 are equally likely to occur. How...
This article presents a class of integer codes that are suitable for use in optical computer network...
This article presents a class of integer codes that are suitable for use in optical computer network...
In public optical networks, the data are scrambled with a xu + 1 self-synchronous scramblers (SSSs)....
In optical networks without optical amplifiers, the number of received photons never exceeds the num...
In optical networks without optical amplifiers, the number of received photons never exceeds the num...
In most communication networks, error probabilities 1 → 0 and 0 → 1 are equally likely to occur. How...
This paper presents two classes of integer codes that are suitable for use in local area networks. T...
In short-range optical networks, channel errors occur due to energy losses. Upon transmission, they ...
In short-range optical networks, channel errors occur due to energy losses. Upon transmission, they ...
This paper presents a class of integer codes capable of correcting l-bit burst asymmetric errors wit...
Correcting single and detecting adjacent errors has become important in memory systems using high de...
In this paper, we present a class of integer codes capable of correcting burst asymmetric errors. Th...
In most communication networks, error probabilities 1 → 0 and 0 → 1 are equally likely to occur. How...
In public optical networks, the data are scrambled with a xu + 1 self-synchronous scramblers (SSSs)....
In most communication networks, error probabilities 1 → 0 and 0 → 1 are equally likely to occur. How...