Contiguous sequence of errors occurring in a communications channel
You can helpexpand this article with text translated fromthe corresponding article in German. (August 2020)Click [show] for important translation instructions.
Machine translation, likeDeepL orGoogle Translate, is a useful starting point for translations, but translators must revise errors as necessary and confirm that the translation is accurate, rather than simply copy-pasting machine-translated text into the English Wikipedia.
Consideradding a topic to this template: there are already 2,341 articles in themain category, and specifying|topic= will aid in categorization.
Do not translate text that appears unreliable or low-quality. If possible, verify the text with references provided in the foreign-language article.
Youmust providecopyright attribution in theedit summary accompanying your translation by providing aninterlanguage link to the source of your translation. A model attribution edit summary isContent in this edit is translated from the existing German Wikipedia article at [[:de:Burstfehler]]; see its history for attribution.
You may also add the template{{Translated|de|Burstfehler}} to thetalk page.
Intelecommunications, aburst error orerror burst is a contiguoussequence of symbols, received over acommunication channel, such that the first and last symbols are inerror and there exists no contiguous subsequence ofm correctly received symbols within the errorburst.[1] The integer parameterm is referred to as theguard band of the error burst. The last symbol in a burst and the first symbol in the following burst are accordingly separated bym correct symbols or more. The parameterm should be specified when describing an error burst.
TheGilbert–Elliott model is a simplechannel model introduced byEdgar Gilbert[2] and E. O. Elliott[3] that is widely used for describing burst error patterns in transmission channels and enables simulations of the digital error performance of communications links. It is based on aMarkov chain with two statesG (for good or gap) andB (for bad or burst). In stateG the probability of transmitting a bit correctly isk and in stateB it ish. Usually,[4] it is assumed that k = 1. Gilbert provided equations for deriving the other three parameters (G andB state transition probabilities andh) from a given success/failure sequence. In his example, the sequence was too short to correctly findh (a negative probability was found) and so Gilbert assumed that h = 0.5.
