Premium
Een kort overzicht van codes die tegen foutenuitbarsting bestand zijn *
Author(s) -
Gross Alan J.
Publication year - 1964
Publication title -
statistica neerlandica
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.52
H-Index - 39
eISSN - 1467-9574
pISSN - 0039-0402
DOI - 10.1111/j.1467-9574.1964.tb00532.x
Subject(s) - hamming code , burst error , hamming distance , channel (broadcasting) , arithmetic , error detection and correction , mathematics , algorithm , binary number , computer science , discrete mathematics , statistics , block code , telecommunications , decoding methods
Summary When information is transmitted over a channel errors often occur in bursts, usually due to the presence of some disturbance in the channel for a short period of time. Thus, it is possible that a single burst of two or three errors occurs somewhere in the message whereas the remainder of the message is error‐free. In this article we discuss only binary burst‐error‐correcting codes. We introduce the work of HAMMING, ABRAMSON, BOSE and CHAKRA VARTI, and GROSS all of whom have constructed burst‐error‐correcting codes, and whose codes are capable of correcting single bursts of errors of length less than or equal to four.