3 3 votes A block code scheme has the following set of valid code words:$$000111,011001,100101,111010$$What is the maximum number of bit errors that can be detected?$1$ $2$ $3$ $4$ Computer Networks goclasses computer-networks goclasses-cs-dpp goclasses-cs-dpp-day-100 goclasses-cn-practice-questions + – GO Classes 667 views answer comment Share Follow Print See all 5 Comments 5 5 Comments reply shashank sharma_1 commented Oct 4, 2025 reply Follow flag Answer will be B. 1. finding miminum hamming distance, here the first and third valid code have a differnce of 2 bits, so our hamming distance will be 3, and we will be able to detect 2 errors and correct upto 1 error, 0 0 replyShare shashank sharma_1 commented Oct 4, 2025 reply Follow flag Answer will be B. 1. finding miminum hamming distance, here the first and third valid code have a differnce of 2 bits, so our hamming distance will be 3, and we will be able to detect 2 errors. 0 0 replyShare Franz Kafka commented Oct 6, 2025 reply Follow flag @shashank sharma_1 Bro, if diffrence is 2 bits then that's our hamming distance. You don't have to add another extra 1 into it. 0 0 replyShare shashank sharma_1 commented Oct 6, 2025 reply Follow flag @pranavbhosle_ okay, i have made a mistake, i was thinking this-> 2 invalid code in between of 2 valid code for that i was adding +1. Will work more on it. 0 0 replyShare Franz Kafka commented Oct 6, 2025 reply Follow flag It happens bro 😌 0 0 replyShare Please log in or register to add a comment.
1 1 vote Answer is hamming distsance is 2 here 000111 and 100101 so we can able to detect 1 bit error and 0 bit error correction Vishv answered Oct 4, 2025 Vishv comment Share Follow 0 reply Please log in or register to add a comment.
