[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: nsec++

> No offense to Andrew, but my unnecessary complexity meter was reading
> yellowish green when the WG decided to go with windowed bitmaps, and
> today's discussion of algorithms by which one might determine the most
> compact among multiple possible encodings kicks it up into the orange.

	"Choose the most compact" was never going to fly without
	a differentiator between identically compact results.

	I do however thing that you can describe a algorithm which
	will alway produce the mimimal size and same encoding with
	sliding 256 bit windows.
 
	The second description I sent out is not much more difficult
	to encode / verify than the plain 256 bit window scheme.

	Mark
> --
> to unsubscribe send a message to namedroppers-request@ops.ietf.org with
> the word 'unsubscribe' in a single line as the message text body.
> archive: <http://ops.ietf.org/lists/namedroppers/>
--
Mark Andrews, Internet Software Consortium
1 Seymour St., Dundas Valley, NSW 2117, Australia
PHONE: +61 2 9871 4742                 INTERNET: Mark.Andrews@isc.org

--
to unsubscribe send a message to namedroppers-request@ops.ietf.org with
the word 'unsubscribe' in a single line as the message text body.
archive: <http://ops.ietf.org/lists/namedroppers/>