On Thu, 25 Mar 2021, Tony Finch wrote:
Stuart Cheshire and Mary Baker have a super elegant binary escaping scheme
called "consistent overhead byte stuffing" (COBS) that has a guaranteed
overhead of less than 1%.
That's quite clever, although it only avoids a single value and it's not
immediately obvious how to extend it to multiple values. Applying it
iteratively for different values wouldn't work.
This was his PhD thesis published over 20 years ago. Has anyone ever used
it in practice?
John Levine, johnl(_at_)taugh(_dot_)com, Taughannock Networks, Trumansburg NY
Please consider the environment before reading this e-mail. https://jl.ly
ietf-smtp mailing list