Integer codes correcting burst and random asymmetric errors within a byte

doi:10.1016/j.jfranklin.2017.11.033

Return

Integer codes correcting burst and random asymmetric errors within a byte

2018-01-01

Aleksandar Radonjić *

Vladimir Vujičić

DOI：10.1016/j.jfranklin.2017.11.033

Original

Save

View PDF

Abstract

En 中文

In most communication networks, error probabilities 1 -> 0 and 0 -> 1 are equally likely to occur. However, in some optical networks, such as local and access networks, this is not the case. In these networks, the number of received photons never exceeds the number of transmitted ones. Hence, if the receiver operates correctly, only 1 -> 0 errors can occur. Motivated by this fact, in this paper, we present a class of integer codes capable of correcting burst and random asymmetric (1 -> 0) errors within a b-1 bit byte. Unlike classical codes, the proposed codes are defined over the ring of integers modulo 2(b) - 1. As a result, they have the potential to be implemented in software without any hardware assist. (C) 2017 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.

Keywords:

DETECTING CODES

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.