On 2009-12-26 05:52, wei zhang wrote:
...
> A good answer is that the EID should also be aggregateable,
I may be missing what you mean, because it seems to me that
any set of bit strings (even of variable length) is aggregatable
to an arbitrary extent. Just build a binary tree and chop it
off at whatever level you want (/N if you want 2^N aggregates).
(The equivalent has to be true for namespaces using n-ary instead of
binary symbols.)
Brian
_______________________________________________
rrg mailing list
rrg@irtf.org
http://www.irtf.org/mailman/listinfo/rrg
