substitution boxes and such

Thread View: comp.lsi

1 messages

[T] Back to Threads [V] Tree View [G] Group Articles

1 total messages Started by Jeffrey Frey P730 Fri, 21 Apr 1995 00:00

#1347

Author: Jeffrey Frey P730
Date: Fri, 21 Apr 1995 00:00

18 lines
1430 bytes

Hi

I would like to build an efficent counter that will sequence
thru all of it's unique states in as many ways as possible
(without repeating any) via some sort of seed or control mechanism. 

I am not a mathematician (and I may really embarrass myself here :))
but I *believe* there are (2^n)! possible unique sequences for a n bit 
counter; ie. 40320 possbile unique (8 state) sequences for 
a 3 bit counter. That's a large LUT using a brute force approach.

Anyone have any slick tricks (algorithms) for achieving a 
high number different sequneces, efficently?

Please reply to (or copy) jfrey@bnr.ca as I am not a regular 
subscriber to this news group.

thanks

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads