128
Bit stuffing is one coding technique for preventing patterns from occurring in data. The code rate for bit stuffing is always less than the Shannon capacity.
A 5-bit pattern consists of 5 binary digits, where each digit can be either 0 or 1. Therefore, for each of the 5 positions, there are 2 choices (0 or 1). The total number of distinct 5-bit patterns is calculated as (2^5), which equals 32. Thus, there are 32 distinct 5-bit patterns.
5
Converting Gray Code to Binary1). Write down the number in gray code.2). The most significant bit of the binary number is the most significant bitof the gray code.3). Add (using modulo 2) the next significant bit of the binary number to thenext significant bit of the gray coded number to obtain the next binary bit.4). Repeat step 3 till all bits of the gray coded number have been added inmodulo 2. The resultant number is the binary equivalent of the gray number.Converting Binary to Gray Code1). Write down the number in binary code.2). The most significant bit of the gray number is the most significant bitof the binary code.3). Add (using modulo 2) the next significant bit of the binary number to thenext significant bit of the binary number to obtain the next gray coded bit.4). Repeat step 3 till all bits of the binary coded number have been added inmodulo 2. The resultant number is the gray coded equivalent of the binarynumber.
The gray code for the decimal number 6 in four-bit format is 1011. To convert from binary to gray code, the most significant bit (MSB) remains the same, and each subsequent bit is derived by XORing the current bit with the previous bit in the binary representation. The binary representation of 6 is 0110, which converts to gray code as follows: 0 (MSB), 1 (0 XOR 1), 1 (1 XOR 1), 1 (1 XOR 0), resulting in 1011.
127.
After a bit of digging - that is a mobile (cell) number originating in america. 001 is the IDD code for america.... 415 is the code indicating a cell-phone.
characteristic of Gray code
When going from one number to the next in Gray Code 1 bit only ever changes, whereas with binary more than 1 bit could change.
Oh, dude, so like, in binary, a parity bit is just a way to check if the number of ones in a set of bits is even or odd. In this case, for the binary number 1011, the even parity bit would be 0 because there are already an odd number of ones, and the odd parity bit would be 1 because, well, it's odd. So, yeah, that's the deal with parity bits.
7 bits can make 128 distinct codes.
In weighted codes, for each position(or bit),there is specific weight attached.For example,in binary number,each bit is assigned a particular weight 2n where n is the bit(or position) number for n=0,1,2,3,4 and the weights are 1,2,4,8,16 respectively.