What is the smallest power of 2 needed to generate a binary


a) Suppose N = 8.
What is the maximum number of DECIMAL digits that can be generated with this choice of N (ie. the maximum length of the sequence of decimal numbers that could be generated with this choice of N, before any number repeats itself)?
What is the maximum number of BINARY digits that can be generated with this choice of N (ie. the maximum length of a binary keytext that could be generated with this choice of N; think how many bits you need for EACH decimal number)?

b) Suppose now we have a secret message that is 110 BINARY digits long.
What is the smallest power of 2 needed to generate a binary codeword long enough for this message? i.e. find N (= 2k) =
What is the maximum number of binary digits that can be generated with this choice of N?

Request for Solution File

Ask an Expert for Answer!!
Electrical Engineering: What is the smallest power of 2 needed to generate a binary
Reference No:- TGS0585849

Expected delivery within 24 Hours