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 ________.
A code with minimum distance 2 can detect any single error. A simple way to build one is to send 4 data bits plus 1 even-parity bit: any two codewords then differ in at least 2 positions.
This gives $2^4=16$ codewords. It cannot be beaten: if there were 17 codewords of length 5, two of them would agree in the first 4 bits (only 16 prefixes exist), so they would differ in at most 1 position, violating $d\ge2$. The maximum is 16.
More Information Theory questions
GATE 2016 EC Q58– Consider a discrete memoryless source with alphabet S = \s 0, s 1, s 2, s 3, s 4, \ and…
GATE 2015 EC Q59– The input X to the Binary Symmetric Channel (BSC) shown in the figure is '1' with…
GATE 2017 EC Q31– Let (X 1, X 2) be independent random variables. X 1 has mean 0 and variance 1, while X 2…
GATE 2014 EC (EC1) Q33– Find the capacity of a binary symmetric channel with crossover probability 0.5.
GATE 2014 EC (EC1) Q62– A fair coin is tossed until the first head. L is the number of tosses. Find entropy H(L)…
GATE 2014 EC (EC2) Q32– AWGN capacity is C=W 2(1+P/(2W)) bps, where W is bandwidth, P average received power and 2…