Which of the following statement(s) is/are true: The strength of binary code depends on the hamming distance between codewords The strength of binary code does not depend on the hamming distance between codewords The minimum distance of linear block code is the minimum distance of its codewords The minimum distance of linear block code is the maximum distance of its codewords.

The first statement is false. The strength of binary code does not depend on the hamming distance between codewords. The Hamming distance is a measure of the difference between two binary sequences, but it does not determine the strength of the code.

The second statement is true. The strength of binary code does not depend on the hamming distance between codewords. The strength of a binary code is determined by factors such as its error detection and correction capabilities, not the Hamming distance between codewords.

The third statement is true. The minimum distance of a linear block code is indeed the minimum Hamming distance between its codewords. This minimum distance is a key parameter in determining the error detection and correction capabilities of the code.

The fourth statement is false. The minimum distance of a linear block code is not the maximum distance of its codewords. It is the minimum Hamming distance between codewords.