Q. Consider a binary channel code in which each codeword has a fixed length of 5 bits. The Hamming distance between any pair of distinct codewords in this code is at least 2. The maximum number of codewords such a code can contain isΒ
Ans: 16
Take Mock Tests
| Government Schemes Mock Test | Start Test! |
| Political Science Mock Test β 42 | Start Test |
| History Test β 190 | Start Test |
| Quantitative Aptitude Test | Start Test! |
| Trigonometry - Mock Test | Start Test! |
| Data Interpretation - Mock Test | Start Test! |
| General Awareness - Mock Test | Start Test! |
| Reasoning Ability - Mock Test | Start Test! |
| Englist(Antonyms) Mock Test 1 | Start Test! |
| Quantitative Aptitude (Percentage) Mock Test | Start Test! |
| Economy Mock Test 1 | Unlock Test! |
| Economy Mock Test 2 | Unlock Test! |
| Economy Mock Test 3 | Unlock Test! |
| Books & Authors - Test 2 | Unlock Test! |
