Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged hamming-code
2
votes
1
answer
1
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 10
Which of the following is/are true in context of error control? A CRC of length $\text{R}$ is calculated over a message of length $\text{M}$ ... code set has a minimum Hamming distance of two. A larger Hamming distance is needed to detect errors than to correct errors.
GO Classes
asked
in
Computer Networks
Jan 21
by
GO Classes
670
views
goclasses2024-mockgate-12
goclasses
computer-networks
hamming-code
multiple-selects
1-mark
0
votes
1
answer
2
UGC NET CSE | June 2008 | Part 2 | Question: 3
If a code is t-error correcting, the minimum Hamming distance is equal to : $2 t+1$ $2 t$ $2 t-1$ $t-1$
admin
asked
in
Others
Jan 6
by
admin
89
views
ugcnetcse-june2008-paper2
hamming-code
error-correction
0
votes
0
answers
3
Hamming code
in reciever side to detect err which one representation we should follow to know that in which bit error is present in hamming code? p1 p2 d1 p4 d2 d3 d4 p8 d5 d6 d6 d5 p8 d4 d3 d2 p4 d1 p2 p1
Ray Tomlinson
asked
in
Computer Networks
Aug 17, 2023
by
Ray Tomlinson
387
views
computer-networks
hamming-code
1
vote
1
answer
4
Made Easy Test Series 2024
Given data 10111100 Then P1, P2, P4, Pg parity bits that are attached to data to form codeword are Why they are taking parity bits from LHS in below question A 12 bit hamming code whose hexadecimal value is 0xE4F arrives at a receiver. What could be ... not more than 1 bits in error. if we take parity bits in LHS AND RHS we get different result please anyone clarify it
Ray Tomlinson
asked
in
Computer Networks
Aug 16, 2023
by
Ray Tomlinson
725
views
made-easy-test-series
made-easy-booklet
computer-networks
hamming-code
error-detection
error-correction
0
votes
0
answers
5
Computer architecture and organization
Consider the last 4 digits of your student register and append with 1122 and represent the number in binary number for data sequence. a) Apply hamming method to find the parity/check/skip bits and show the whole data sequence transmitted. b) Flip the 5th bit from ... 3 8 1 1 2 2 Binary Sequence 0 0 1 0 1 1 0 0 The data sequence for the example is: 00101100
Karthi2003
asked
in
CO and Architecture
Nov 8, 2022
by
Karthi2003
474
views
co-and-architecture
hamming-code
0
votes
1
answer
6
UGC NET CSE | October 2022 | Part 1 | Question: 55
The representation of $4$ bit code $1101$ into $7$ bit, even parity Hamming code is $(1010101)$ $(1111001)$ $(1011101)$ $(1110000)$
admin
asked
in
Others
Oct 23, 2022
by
admin
1.0k
views
ugcnetcse-oct2022-paper1
hamming-code
0
votes
3
answers
7
The hamming distance between the octets of 0xAA and 0x55 is (A) 7 (B) 5 (C) 8 (D) 6
Jeetmoni saikia
asked
in
Computer Networks
Oct 22, 2022
by
Jeetmoni saikia
438
views
computer-networks
hamming-code
0
votes
1
answer
8
Digital Logic | Doubt
Hamming Distance: We can calculate how much Hamming Distance should be there so that we can correct any wrong bit Hamming Code: By Hamming Code we can correct any wrong bit. Questions: 1] Are they both different techniques or there is relation ... Hamming Distance in any two numbers). 2] Why should anybody use Hamming Code where we can correct error by Hamming Distance?
anupamsworld
asked
in
Digital Logic
Sep 18, 2022
by
anupamsworld
304
views
digital-logic
hamming-code
18
votes
3
answers
9
GATE CSE 2021 Set 1 | Question: 29
Assume that a $12$-bit Hamming codeword consisting of $8$-bit data and $4$ check bits is $d_8d_7d_6d_5c_8d_4d_4d_3d_2c_4d_1c_2c_1$ ... $0$ and $y$ is $1$ $x$ is $1$ and $y$ is $0$ $x$ is $1$ and $y$ is $1$
Arjun
asked
in
Computer Networks
Feb 18, 2021
by
Arjun
15.2k
views
gatecse-2021-set1
computer-networks
hamming-code
2-marks
1
vote
1
answer
10
NIELIT Scientific Assistant A 2020 November: 82
To guarantee correction of upto $5$ errors in all cases, the minimum Hamming distance in a block code must be ______. $11$ $6$ $5$ $2$
gatecse
asked
in
Computer Networks
Dec 9, 2020
by
gatecse
536
views
nielit-sta-2020
computer-networks
hamming-code
3
votes
1
answer
11
UGC NET CSE | October 2020 | Part 2 | Question: 31
Consider a code with only four valid code words: $0000000000$, $0000011111$, $1111100000$, and $1111111111$. This code has distance $5$. If the code word arrived is $0000000111$ then the original code word must be _______ $0000011111$ $0000000000$ $1111100000$ $1111111111$
go_editor
asked
in
Computer Networks
Nov 20, 2020
by
go_editor
2.6k
views
ugcnetcse-oct2020-paper2
computer-networks
hamming-code
0
votes
0
answers
12
Morris Mano Edition 3 Exercise 7 Question 42 (Page No. 306)
It is necessary to formulate the hamming code for four data bits $D _3, D _5, D _6 and D _7$ together with three parity bits $P _1, P _2 and P _3$. evaluate the 7-bit composite code word for the data word 0010. Evaluate ... error detection in the code. Assume that error occurs in the bit $D _5 and P _2$. Show how the error is detected.
ajaysoni1924
asked
in
Digital Logic
Apr 6, 2019
by
ajaysoni1924
1.1k
views
digital-logic
morris-mano
hamming-code
error-correction
error-detection
1
vote
0
answers
13
Morris Mano Edition 3 Exercise 7 Question 41 (Page No. 306)
How many parity check bits must be included with the data word to achieve single-bit error correction and double error correction when data words are as follows: 16 bits 32 bits 48 bits
ajaysoni1924
asked
in
Digital Logic
Apr 6, 2019
by
ajaysoni1924
2.2k
views
digital-logic
morris-mano
hamming-code
error-correction
1
vote
0
answers
14
Morris Mano Edition 3 Exercise 7 Question 40 (Page No. 306)
A 12-bit hamming code word 8-bits of data and 4 parity bits are read from the memory. What was the original 8-bit data word that was written into the memory if the 12-bits word read out are as follows: 000011101010 101110000110 101111110100
ajaysoni1924
asked
in
Digital Logic
Apr 6, 2019
by
ajaysoni1924
738
views
digital-logic
morris-mano
hamming-code
error-correction
0
votes
1
answer
15
Morris Mano Edition 3 Exercise 7 Question 39 (Page No. 305)
Given that 11-bit data word 11001001010, generate the 15-bit hamming code word.
ajaysoni1924
asked
in
Digital Logic
Apr 6, 2019
by
ajaysoni1924
1.3k
views
digital-logic
morris-mano
hamming-code
1
vote
0
answers
16
Morris Mano Edition 3 Exercise 7 Question 38 (Page No. 305)
Given the 8-bit data word 01011011, generate the 13-bit composite word for the Hamming code that corrects the single bit error and detects double bit errors.
ajaysoni1924
asked
in
Digital Logic
Apr 6, 2019
by
ajaysoni1924
1.3k
views
digital-logic
morris-mano
hamming-code
error-correction
error-detection
0
votes
1
answer
17
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 12 (Page No. 252)
Suppose that data are transmitted in blocks of sizes 1000 bits. What is the maximum error rate under which error detection and retransmission mechanism (1 parity bit per block) is better than using Hamming code? Assume that bit errors are independent of one another and no bit error occurs during retransmission.
ajaysoni1924
asked
in
Computer Networks
Mar 16, 2019
by
ajaysoni1924
1.9k
views
computer-networks
data-link-layer
tanenbaum
hamming-code
1
vote
0
answers
18
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 10 (Page No. 252)
A 12-bit Hamming code whose hexadecimal value is 0xE4F arrives at a receiver. What was the original value in hexadecimal? Assume that not more than 1 bit is in error.
ajaysoni1924
asked
in
Computer Networks
Mar 16, 2019
by
ajaysoni1924
747
views
computer-networks
data-link-layer
error-detection
hamming-code
tanne
tanenbaum
0
votes
1
answer
19
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 9 (Page No. 252)
Sixteen-bit messages are transmitted using a Hamming code. How many check bits are needed to ensure that the receiver can detect and correct single-bit errors? Show the bit pattern transmitted for the message 1101001100110101. Assume that even parity is used in the Hamming code.
ajaysoni1924
asked
in
Computer Networks
Mar 16, 2019
by
ajaysoni1924
2.1k
views
computer-networks
data-link-layer
tanenbaum
hamming-code
1
vote
0
answers
20
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 8 (Page No. 252)
To provide more reliability than a single parity bit can give, an error-detecting coding scheme uses one parity bit for checking all the odd-numbered bits and a second parity bit for all the even-numbered bits. What is the Hamming distance of this code?
ajaysoni1924
asked
in
Computer Networks
Mar 16, 2019
by
ajaysoni1924
878
views
computer-networks
data-link-layer
tanenbaum
error-detection
hamming-code
0
votes
0
answers
21
hamming code
what is approach to solve this type of question?
Rahul_Rathod_
asked
in
Computer Networks
Jan 19, 2019
by
Rahul_Rathod_
594
views
hamming-code
computer-networks
hamming
hamming
distance
1
vote
0
answers
22
MadeEasy Test Series 2019: Digital Logic - Hamming Code
plz tell the answer
suneetha
asked
in
Digital Logic
Jan 12, 2019
by
suneetha
631
views
digital-logic
hamming-code
made-easy-test-series
1
vote
1
answer
23
Hamming Error Correction- Madeeasy 2019
someone please post detailed solution pic for this procedure- I am getting bits 1 and 2 as errorneous.
Markzuck
asked
in
Computer Networks
Jan 9, 2019
by
Markzuck
1.5k
views
computer-networks
distance
hamming
hamming-code
0
votes
0
answers
24
UPPCL AE 2018:14
Suppose that a code has the following four valid codewords: $\begin{array} \\ 11001100 \\ 00110011 \\ 11111111 \\ 00000000 \end{array}$ What is the minimum number of errors that can be detected for this code? $3$ $4$ $2$ $1$
admin
asked
in
Computer Networks
Jan 5, 2019
by
admin
354
views
uppcl2018
computer-networks
hamming-code
error-detection
2
votes
2
answers
25
#CN Forouzan Error Correction Hamming Code
If the Hamming distance between a dataword and the corresponding codeword is three, there are _____ bits in error. A) 5 B) 4 C) 3 D) none of the above
iarnav
asked
in
Computer Networks
Nov 19, 2018
by
iarnav
3.0k
views
computer-networks
hamming-code
hamming
distance
error-detection
0
votes
2
answers
26
GATE-ECE-2018
Consider a binary channel code in which each codeword has a fixed length of 5 bits. The Hamming distance between any pair of distinct codewords in this code is at least 2. The maximum number of codewords such a code can contain is _________.
aditi19
asked
in
Digital Logic
Nov 14, 2018
by
aditi19
3.7k
views
usergate2018
digital-logic
hamming-code
Page:
1
2
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged hamming-code
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...