Question

please explain why 1010????

and also why c can be represent in that way?

please draw table

error code

9:07 No SIM For an integer n greater than or equal to 0, a code g that associates it with a 4-bit code word g (n) is obtained as shown on the right, but it is assumed that the following condition is satisfied 10001 2 0011 3 0010 0110 5 0111 6 0101 7 0100 8 1100, 9 1101 . For if iヂj g(i) g(j) the hamming distance d(x,y) for arbitrary n is d ( (n) and g (n+ 1))1 answer the following questions: (a) Find g (12) (B) What is the largest n that can be represented by this code (C) A binary representation of n as a (right- handed) 4-bit code word is represented by B(n) (example: β (0-0000, β (1)-0001, β (2) 0010". When the addition modulo 2 (bitwise exclusive OR) of bit units is represented by +, what is g (n) + B (n) Observe that there is regularity and express g (n) in the range of on 0<-n< 12 using β (n) and β (n/ 2))

Answer 1

1100 usive r ュ1010(x0R)-0110 010 0110 (0, 2-1). (0,15) 0, 2-1

6001 Oool 006i 00tI OotI 3 0100 四010 o(1 0 4- 0101 ODID O1ll 0101 Shnve he asbcd to fnd a relotion behan gen) and ecn), BCng) bg more reaho Both tola