Exam 6: Error Detection and Correction

Error correction is best used with wireless applications.

Redundant bits are used by the _________ for the purpose of error detection or correction.

The ratio of redundant bits to data bits,(n - k)/k ,is called the __________ of the code.

FEC codes are designed not just to detect but correct errors,avoiding the need for __________.

________ is one of the most fundamental requirements in the transmission of a stream of bits from one device to another.

The use of Manchester encoding is a form of synchronization.

The data,plus preamble,postamble and control information are called a ________.

The simplest error-detecting scheme is to append a __________ bit to the end of a block of data.

In a(n)________ there is a cluster of bits in which a number of errors occur,although not necessarily all of the bits in the cluster suffer an error.

The ratio of redundant bits to data bits is called the ________ of the code.

Forward error correction schemes are frequently used in __________ transmission, where retransmission schemes are highly inefficient and error rates may be high.

Modulo 2 arithmetic uses binary addition with no carries,which is just the exclusive-OR (XOR)operation.

Single bit errors are more common and more difficult to deal with.

___________ operates in a fashion similar to error detection but is capable of correcting certain errors in a transmitted bit stream.

A __________ error can occur in the presence of white noise.

Regardless of the design of the transmission system,there will be errors,resulting in the change of one or more bits in a transmitted block of data.

The Internet checksum is considerably less effective than the CRC.

The ________ is a measure of how much additional bandwidth is required to carry data at the same data rate as without the code.

In __________ transmission systems,an error occurs when a binary 1 is transmitted and a binary 0 is received,or a binary 0 is transmitted and a binary 1 is received.

An ___________ is a group of bits in which two successive erroneous bits are always separated by less than a given number x of correct bits.