Re: Fingerprint as cryptokey

In article <ed7q13$qrj@xxxxxxxxxxxxxxxxxxxxxxx>,
Mike Amling <nospam@xxxxxxxxxx> wrote:
Bryan Olson wrote:
Mike Amling wrote:
However, its possible to partition an N-dimensional space so that no
point is close to more than N+1 regions.

Ah... that's a good thing to know, and I did not. One
dimension is obvious; in two dimensions, hexagons work and
so do courses of bricks; in three, shifted courses of bricks
look good. Maybe shifted-courses work indefinitely? Is there
a proffered general construction?

Er... The N-dimensional offset parallelopipeds (bricks) work fine in
Euclidean space R**N, but I'm not sure what I claimed is still true if
one or more dimensions are discrete, rather than continuous.

No, they do not.

Kim0



.

Relevant Pages

  • Re: Fingerprint as cryptokey
    ... A cooperating "sender" would send only a codeword that is far from the boundary of its containing region. ... so do courses of bricks; in three, shifted courses of bricks ... cardinality is linear in the number of dimensions measured. ...
    (sci.crypt)
  • Re: UKIP, Metrification and Low Railway Bridges
    ... The bricks were to an imperial set of dimensions. ... Trying to make some modifications was a real PITA as modern bricks are metric and don't match. ...
    (uk.railway)
  • Re: Alignments of the Newport Tower
    ... That's because the 'module' system enetered architectural design about ... The dimensions of bricks are designed to fit modules. ...
    (sci.archaeology)
  • Re: Fingerprint as cryptokey
    ... in two dimensions, hexagons work and ... so do courses of bricks; in three, ... Euclidean space R**N, but I'm not sure what I claimed is still true if one or more dimensions are discrete, rather than continuous. ...
    (sci.crypt)
Quantcast