Tasks
Instructions
    Quick theory overview:
  • For a non-linear block code, \(M\) is the total number of codewords and the rate is R = \(\frac{log_2 M}{n}\).
  • For a linear block code, \(2^k\) is the total number of codewords and the rate is R = \(\frac{k}{n}\).
  • The minimum distance of a block code denoted by \(d_{min}\) is the minimum Hamming distance over all the distinct codewords in the codebook.

    Procedure:
  • Enter the values in the fields and click on Submit.
  • The rate should be rounded to 2 decimal places.
  • The correctness of the entered answer is displayed in Observations.
  • Next - Displays the next example.
  • Previous - Displays the previous example.



Codebook:


0
0
0
1
0
0
1
0
1
1
0
1
1
0
1
1
0
0
1
1
1
0
1
0
1
1
1
0
0
1


Enter the parameters of the given non-linear block code.

Observations