Re: [idn] LACE Algorithm Comments

[Paul Hoffman / IMC <phoffman@imc.org>]

At 11:43 AM -0500 12/26/00, Hollenbeck, Scott wrote:
>A few comments on the compression algorithm described in
>draft-ietf-idn-lace-00.txt:
>
>Comment 1: I'd like to suggest a minor change to step 1 of section 2.4.1.
>The existing text reads as follows:
>
>"1) If the length of the input is not even, or is less than 2, stop with an
>error."
>
>to this (with new words in upper case):
>
>"1) If the length of the input IN OCTETS is not even, or is less than 2,
>stop with an error."
>
>This should avoid any confusion with someone interpreting "length of the
>input" to mean "length of the input in code points".

Good catch!

>Comment 2: I believe the formula for calculating the next location of the IP
>input pointer described in compression step 5 is incorrect.  Instead of "IP
>= IP+(2*(COUNT+1))", I believe it should be "IP = IP+(2*COUNT)".

Another good catch. This is an artifact of an earlier version of the 
document where the count might be 0.

--Paul Hoffman, Director
--Internet Mail Consortium