Alpha Geek

(8)

$10/per page/Negotiable

About Alpha Geek

Levels Tought:
University

Expertise:
Accounting,Algebra See all
Accounting,Algebra,Architecture and Design,Art & Design,Biology,Business & Finance,Calculus,Chemistry,Communications,Computer Science,Environmental science,Essay writing,Programming,Social Science,Statistics Hide all
Teaching Since: Apr 2017
Last Sign in: 438 Weeks Ago, 1 Day Ago
Questions Answered: 9562
Tutorials Posted: 9559

Education

  • bachelor in business administration
    Polytechnic State University Sanluis
    Jan-2006 - Nov-2010

  • CPA
    Polytechnic State University
    Jan-2012 - Nov-2016

Experience

  • Professor
    Harvard Square Academy (HS2)
    Mar-2012 - Present

Category > Statistics Posted 09 May 2017 My Price 5.00

In the previous problem we tried to find the number

In the previous problem we tried to find the number of bits to be added to a dataword to correct a single-bit error. If we need to correct more than one bit, the number of redundant bits increases. What should the number of redundant bits (r) be to automatically correct one or two bits (not necessarily contiguous) in a dataword of size k? After finding the relationship, find the number of bits in r if k is 1, 2, 5, 50, or 1000.

 

 

Dec 08 2016 02:45 PM

Answers

Alpha Geek
(8)
Status NEW Posted 09 May 2017 10:05 AM My Price 5.00

-----------

Attachments

file 1494326157-Answer.docx preview (132 words )
I-----------n t-----------he -----------pre-----------vio-----------us -----------pro-----------ble-----------m w-----------e t-----------rie-----------d t-----------o f-----------ind----------- th-----------e n-----------umb-----------er -----------of -----------bit-----------s t-----------o b-----------e a-----------dde-----------d t-----------o a----------- da-----------taw-----------ord----------- to----------- co-----------rre-----------ct -----------a s-----------ing-----------le------------bit----------- er-----------ror-----------. I-----------f w-----------e n-----------eed----------- to----------- co-----------rre-----------ct -----------mor-----------e t-----------han----------- on-----------e b-----------it,----------- th-----------e n-----------umb-----------er -----------of -----------red-----------und-----------ant----------- bi-----------ts -----------inc-----------rea-----------ses-----------. W-----------hat----------- sh-----------oul-----------d t-----------he -----------num-----------ber----------- of----------- re-----------dun-----------dan-----------t b-----------its----------- (r-----------) b-----------e t-----------o a-----------uto-----------mat-----------ica-----------lly----------- co-----------rre-----------ct -----------one----------- or----------- tw-----------o b-----------its----------- (n-----------ot -----------nec-----------ess-----------ari-----------ly -----------con-----------tig-----------uou-----------s) -----------in -----------a d-----------ata-----------wor-----------d o-----------f s-----------ize----------- k?----------- Af-----------ter----------- fi-----------ndi-----------ng -----------the----------- re-----------lat-----------ion-----------shi-----------p, -----------fin-----------d t-----------he -----------num-----------ber----------- of----------- bi-----------ts -----------in -----------r i-----------f k----------- is----------- 1,----------- 2,----------- 5,----------- 50-----------, o-----------r 1-----------000-----------.
Not Rated(0)