Code:
clc;
clear all;
close all;
n=input('enter the code bits :
n :');
k=input('enter the data bits :
k :');
m=n-k; disp(m);
z=2^m; disp (z);
i=0;
for j=0:1:n
sum=0;
for i=0:1:j
c=factorial(n)/(factorial(n-i)*factorial(i));
sum=sum+c;
end
if sum
>=z
j=j-1;
sum=sum-c;
break;
end
end
ans=sprintf('(%d,%d) can correct
all combinations of %d errors and it can also correct %d combinations of %d
errors' , n,k,j,z-sum,j+1);
disp(ans);
OUTPUT
enter the code bits : n :7
enter the data bits : k :4
(7,4) can correct all combinations of 0 errors and it
can also correct 7 combinations of 1 errors
0 comments:
Post a Comment