This article is ratedStub-class on Wikipedia'scontent assessment scale. It is of interest to the followingWikiProjects:

ComputingLow‑importance This article is within the scope ofWikiProject Computing, a collaborative effort to improve the coverage ofcomputers,computing, andinformation technology on Wikipedia. If you would like to participate, please visit the project page, where you can jointhe discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing Low This article has been rated asLow-importance on theproject's importance scale.

  I thought the Kasami Sequences were of length 2^N-1.
The first line of the page says they are of length 2^N.
For example for the N=6 set the length is 2^6-1=63 and
there are 2^(N/2)=2^3=8 available sequences.

Best regards,

Gt7219b (talk)01:43, 14 June 2010 (UTC)gt7219b[reply]

• Stub-Class Computing articles
• Low-importance Computing articles
• All Computing articles