A truely BIJECTIVE BWT is here!
- From: biject <davvid_a_scott@xxxxxxxxx>
- Date: Wed, 12 Dec 2007 20:00:12 -0800 (PST)
I just created what I think is the first truely bijective
BWT through my Scottification process.
My code is a mod of Marks BWT and should
function in most cases as a drop in replacement.
I call it BWTS.
my bijective BWT at:
http://bijective.dogma.net/bwts.zip
it does what BWT should have done the transform with out
an index. N bytes to N bytes with only the order changed.
I don't think anyone else has a practical working bijective
BWT transform it took a lot of trail and error to make it
so that on the average it will lead to bijective BWT compression
with out the stupid INDEX and it will lead to better compression
on the average.
Thank You
Merry Christmas
David A. Scott
--
My Crypto code
http://bijective.dogma.net/crypto/scott19u.zip
http://www.jim.com/jamesd/Kong/scott19u.zip old version
My Compression code http://bijective.dogma.net/
**TO EMAIL ME drop the roman "five" **
Disclaimer:I am in no way responsible for any of the statements
made in the above text. For all I know I might be drugged.
As a famous person once said "any cryptograhic
system is only as strong as its weakest link"
.
- Follow-Ups:
- Re: A truely BIJECTIVE BWT is here!
- From: Phil Carmody
- Re: A truely BIJECTIVE BWT is here!
- From: Mark Nelson
- Re: A truely BIJECTIVE BWT is here!
- From: Industrial One
- Re: A truely BIJECTIVE BWT is here!
- Prev by Date: Re: presentation of perpetual compression to investors
- Next by Date: Re: Splitting image into periodic lattice of fractals instead of squares.
- Previous by thread: presentation of perpetual compression to investors
- Next by thread: Re: A truely BIJECTIVE BWT is here!
- Index(es):
Relevant Pages
|