World Library  
Flag as Inappropriate
Email this Article

Burst error

Article Id: WHEBN0000041119
Reproduction Date:

Title: Burst error  
Author: World Heritage Encyclopedia
Language: English
Subject: Error detection and correction, Burst error-correcting code, Reed–Solomon error correction, Markov models, Cyclic redundancy check
Collection: Data Transmission, Markov Models
Publisher: World Heritage Encyclopedia

Burst error

In telecommunication, a burst error or error burst is a contiguous sequence of symbols, received over a data transmission channel, such that the first and last symbols are in error and there exists no contiguous subsequence of m correctly received symbols within the error burst.[1]

The integer parameter m is referred to as the guard band of the error burst. The last symbol in a burst and the first symbol in the following burst are accordingly separated by m correct bits or more. The parameter m should be specified when describing an error burst. For example, imagine sending a packet containing all of the letters of the alphabet, A through Z. If the recipient's computer "opens" the packet and finds that the first letter in the sequence is "Q" and the last letter in the sequence is "R," that is a burst error. The "burst" of data in the packet is corrupt.

Although in the example the first and last letters are defined as corrupt, that does not mean that every letter within the packet is damaged. Imagine that every other letter is as it should be; only position one, "A," and position 26, "Z," have been damaged. The number of correct bits of information between the damaged ends is called the guard band. In this case, the guard band would be 24, because there are 24 correct letters separating the two damaged ones

Channel model

The Gilbert–Elliott model is a simple channel model introduced by Edgar Gilbert[2] and E. O. Elliott [3] widely used for describing burst error patterns in transmission channels, that enables simulations of the digital error performance of communications links. It is based on a Markov chain with two states G (for good or gap) and B (for bad or burst). In state G the probability of transmitting a bit correctly is k and in state B it is h. Usually,[4] it is assumed that k = 1 and, Gilbert also assumed that h = 0.5.


  1. ^ Federal Standard 1037C 
  2. ^  .
  3. ^ Elliott, E. O. (1963), "Estimates of error rates for codes on burst-noise channels",  .
  4. ^ Lemmon, J.J.: Wireless link statistical bit error model. US National Telecommunications and Information Administration (NTIA) Report 02-394 (2002)

External links


 This article incorporates public domain material from the General Services Administration document "Federal Standard 1037C" (in support of MIL-STD-188).

This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.

Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.