2,069 views

1 Answer

Best answer
9 votes
9 votes

$n$ is data bit 

$k$ is number of parity bits 

$n+k \leq 2^k-1$ , as parity bits are used at the locations in power of $2's$ .

$n \leq 2^k-k-1$

$n= 16 $

$16\leq 2^k-k-1$

$k=5 $

selected by

Related questions

0 votes
0 votes
0 answers
1
iarnav asked Nov 16, 2018
489 views
How many bit errors can simple parity bit error detection or 1-D parity bit can detect?I'm pretty confused about it - that can I detect only one bit errors or all odd bit...
1 votes
1 votes
1 answer
2
vinay chauhan asked Jan 4, 2019
1,645 views
How many bits can a 2-dimensional parity detect and correct? Is there any general formula for no of bit detection and correction for N-dimensional parity?
5 votes
5 votes
1 answer
3
Manu Thakur asked Aug 3, 2017
9,832 views
Flag: 01111110Data: 1000111111100111110100011111111111000011111bit stuff the given data?