Hamming Code
Hamming Code
ASSESSMENT - 1
CODE
#include <stdio.h>
#include <string.h>
char data[MAX_LEN];
char gen_poly[MAX_LEN];
char check_value[MAX_LEN];
void XOR()
if (check_value[i] == gen_poly[i])
check_value[i] = '0';
NAME – SOHAM BANDYOAPDHYAY
REG NO. – 21BCE2386
else
check_value[i] = '1';
void receiver()
scanf("%s", data);
crc();
if (i < gen_poly_length - 1)
printf("\nError detected\n\n");
else
}
NAME – SOHAM BANDYOAPDHYAY
REG NO. – 21BCE2386
void crc()
check_value[i] = data[i];
do
if (check_value[0] == '1')
XOR();
check_value[j] = data[i++];
int main()
scanf("%s", data);
scanf("%s", gen_poly);
NAME – SOHAM BANDYOAPDHYAY
REG NO. – 21BCE2386
data_length = strlen(data);
gen_poly_length = strlen(gen_poly);
data[i] = '0';
crc();
receiver();
return 0;
OUTPUT SCREENSHOT
ERROR DETECTED
NAME – SOHAM BANDYOAPDHYAY
REG NO. – 21BCE2386
NAME – SOHAM BANDYOAPDHYAY
REG NO. – 21BCE2386
HAMMING CODE
CODE
#include <stdio.h>
#include <math.h>
int input[32];
int code[32];
int count = 0, i, j;
i = position - 1;
if (code[j] == 1)
count++;
i = i + 2 * position;
if (count % 2 == 0)
return 0;
else
return 1;
int main()
scanf("%d", &n);
scanf("%d", &input[i]);
i = 0;
p_n++;
i++;
c_l = p_n + n;
j = k = 0;
if (i == ((int)pow(2, k) - 1))
code[i] = 0;
k++;
else
code[i] = input[j];
j++;
}
NAME – SOHAM BANDYOAPDHYAY
REG NO. – 21BCE2386
code[position - 1] = value;
printf("%d", code[i]);
printf("\n");
scanf("%d", &code[i]);
int error_pos = 0;
if (value != 0)
error_pos += position;
if (error_pos+1 == 1)
else
return 0;
SCREENSHOT
NAME – SOHAM BANDYOAPDHYAY
REG NO. – 21BCE2386
Error Detected