Explain error detection and correction codes, Computer Engineering

Assignment Help:

Q. Explain Error Detection and Correction Codes?

Before we wind up data representation in reference of today's computers one should determine about code that helps in correction and recognition of errors. Computer is an electronic media hence there is a probability of errors at the time of data transmission. These kinds of errors can result from disturbances in transmission media or external environment.  But what is an error in binary bit?  An error bit alters from  0 to 1 or 1 to 0. One of simplest error detection codes is known as parity bit.


Related Discussions:- Explain error detection and correction codes

Determine the object oriented features, Object Oriented Analysis  T h...

Object Oriented Analysis  T he basics of object oriented analysis with the help of object oriented features. Analysis  Analysis is not a solution of the problem. We w

Find minimum sampling rate of analog signal to be sampled, The analog signa...

The analog signal needs to be sampled at a minimum sampling rate of: (A) 2fs                                               (B) 1/(2fs) (C)  fs/2

Background, Background, Examples and Hypothesis: Now we will switch of...

Background, Examples and Hypothesis: Now we will switch off with three logic programs. So very firstly, we will have the logic program representing a set of positive examples

What do you mean by polynomial and exponential bounds, What do you mean by ...

What do you mean by polynomial and exponential bounds?   Bounds of the form nc for c greater than 0 .such a bound are known as polynomial bounds. Bounds of the form 2(n )  .suc

What is static timing, What is Static timing a. Delays over all paths a...

What is Static timing a. Delays over all paths are added up. b. All possibilities, including false paths, verified without the need for test vectors. c. Faster than simul

What is insertion sort, What is insertion sort? Insertion Sort : One o...

What is insertion sort? Insertion Sort : One of the easiest sorting algorithms is the insertion sort. Insertion sort having of n - 1 passes. For pass p = 2 by  n, insertion so

Why schottky transistors preferred over other transistors , In digital ICs,...

In digital ICs, Schottky transistors are preferred over normal transistors because of their ? Ans. Lower  propagation  delay  in digital ICs, as  shottky  transistors  reduce

Data structures for parallel algorithms, To apply any algorithm selection o...

To apply any algorithm selection of a proper data structure is very significant. An explicit operation might be performed with a data structure in a smaller time however it might n

Categorize the cpu scheduling algorithms, Categorize the CPU scheduling alg...

Categorize the CPU scheduling algorithms? The various CPU scheduling algorithms are categorized as given below:

When page fault frequency in an operating system is reduced, Page fault fre...

Page fault frequency in an operating system is reduced when the? When locality of reference is appropriate to the process so Page fault frequency in an operating system is redu

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd