The number of bits in a message depends on its size and the encoding used. For example, if a message contains 100 characters and uses standard ASCII encoding, it would consist of 800 bits (100 characters x 8 bits per character). In general, to determine the total bits, multiply the number of characters by the number of bits per character based on the encoding scheme.
4
To determine the number of Hamming bits needed for a 100-bit message, we can use the formula (2^r \geq m + r + 1), where (m) is the number of data bits (100 in this case) and (r) is the number of Hamming bits. Solving this inequality, we find that 7 Hamming bits are needed, as (2^7 = 128) satisfies (100 + 7 + 1 = 108). Thus, for a 100-bit message, 7 Hamming bits are inserted.
Informational redundancy is the number of bits that it takes to transmit the desired message minus the actual number of bits that the message contains. In other words, it is the extra bandwidth required to send a message.
In order to know how many bits/second there are in 1 frame/second, you need to know how many bits are in that frame. In a typical asychronous serial protocol with 8 bits per frame, the bit rate would be 0.125 bits/second. If you are talking the IP network layer of TCP/IP, then the frame size is very dependent on the underlying message payload and headers.The original question, by the way, is invalid. Its asks "how many bits does...", but it should have asked "how manys bits per second does...".
1
1
In linear block codes we use individual registers seperately for message bits and for parity bits while transmitting where in case of convolutional codes we use only one register and here the left most bit is the message bit and remaining are parity bits
19,200 bits.
16 bits
96,000 bits However, in Kilobytes (KB), there would be 98304 bits.
one kilobit or k is 1024 bits
The generator matrix is made out of that code word and all the possibilities for the code words. The number of rows of the generator matrix are the number of message bits and the number of columns are equal to the total number of bits i.e parity bits + message bits. The only necessary condition is that each row of generator matrix is linearly independent of the other row.