Return-Path: william@bourbon.usc.edu
Delivery-Date: Sat Feb 18 07:54:02 2006
Received: from bourbon.usc.edu (bourbon.usc.edu [128.125.9.75])
by merlot.usc.edu (8.13.1/8.13.1) with ESMTP id k1IFs2jE020410
for ; Sat, 18 Feb 2006 07:54:02 -0800
Received: from bourbon.usc.edu (localhost.localdomain [127.0.0.1])
by bourbon.usc.edu (8.13.1/8.13.1) with ESMTP id k1IFpuxs025854
for ; Sat, 18 Feb 2006 07:51:56 -0800
Message-Id: <200602181551.k1IFpuxs025854@bourbon.usc.edu>
To: csac@merlot.usc.edu
Subject: Re: CS599: Hw2 - X3
Date: Sat, 18 Feb 2006 07:51:56 -0800
From: william@bourbon.usc.edu
Someone wrote:
> For the test x3, where i am supposed to check for m-bit sequences
> in a n-bit stream.
> Now, will n be a multiple of m and if now what do we do in the
> same case.
>
> Assume the input is of 304 bits and hence n = 304, m=3 and k=101.
>
> Since i need to take m bits at a time on a non-overlap basis, 304
> has 101 such sets plus one bit at the end.
>
> Do we ignore the bit, or pad 2 zeros to it ?
I have mentioned this during lectures (and you can also check
with the test cases). You shoul ignore the bit. You should
never do padding for any of these statistical tests (unless
there is explicit instructions on how to do it).
--
Bill Cheng // bill.cheng@usc.edu