15 Aug 2006 01:09
Help with draft-ietf-bmwg-hash-stuffing-05, 5.2.1. Calculating Bit-Stuffing Probability
Jerry Perser <jperser <at> veriwave.com>
2006-08-14 23:09:15 GMT
2006-08-14 23:09:15 GMT
Could you expand on how a transition matrix works in section 5.2.1? I'm not a probability expert, but I keep getting a different answer than stated. I am using Boolean logic to work out the probability. Looking at the diagram, I see 5 decisions between start and state 5. It's not clear if the bit stuffing happens in state 5 or after state 5. Could this be clarified? Each decision represents a bit. So we have either 5 or 6 bits that get stuffed to 6 or 7 bits. I'll assume 6 bits because it's closer to the drafts solution. With 6 bits there are 64 possible combinations (2 ** 6). It appears that only one combination creates the bit stuffing, which is 111111. So the solution I come up with every time is 1 out of 64 or 1/64. I have no idea how to get 1/62. Please help me. Jerry Perser Veriwave Main : 818-338-4000 Direct: 818-338-4112 Fax: 818-338-4005
RSS Feed