Rajan

  AIM - Write a program to implement various Error              Detection Mechanisms. Find minimum hamming distance n = int(input("Enter the dataword you want: "))  bit = int(input("How many bit of dataword you want to enter: "))  data = [] for i in range(n):  temp = input("Enter dataword "+str(i+1)+ ": ")  if temp not in data:    data.append(temp)   else:    print("You enter duplicate dataword.")  minimumhamming = [] for i in range(len(data)):  c1 = data[i]   for j in range(i+1,len(data)):    count = 0     c2 = data[j]   for k in range(bit):    if(c1[k] != c2[k]):      count+=1   minimumhamming.append(count)  print("Minimum hamming distance is ",min(minimumhamming)) Checksum def findChecksum(c, k):   Sum = bin(int(c[0], 2)+int(c[1], 2)+int(c[2], 2)+int(c[3], 2))[2:]...

  AIM - Write a program to implement various framing              techniques.                 Bit Stuffing def bitstuff(flag,data):     count = 0     ans = ""     ones=0     for i in flag:         if i=='1':             ones+=1     for i in data:         if i=='1':             count+=1             ans += i         else:             count=0             ans+=i         if count==ones-1:             count=0             ans+='0'                  frame = flag+ans+flag     return frame # Unstuffing def bitunstuff(flag,f...