Re: A truely BIJECTIVE BWT is here!

On Dec 15, 1:46 am, Klaus Stengel <Klaus.Sten...@xxxxxxxxxx> wrote:
.....

Compression speed is also likely to be worse. In order to determine what
prefixes have to be cut off in the splitting phase, one needs to search
the smallest string repeatedly in the remaining part of the input
buffer. I haven't made any benchmarks but judging from the structure of
the algorithm, this "preprocessing" can become quite time intensive,
especially with large block sizes and some decreasing sequence in the
beginning of the input blocks (e.g. "987654321").

Bye,
Klaus

My first thought compression speed would be worse. My code is not
for speed. But here at two thoughts.

Each cycle in my way is unique. The case abcababc is treated as 1
on BWTS but 3 on in UNBTS and thats ok. Given strings from
separte cycles are different the compare function need only
compare till the difference is found. two since strings from
different
cycle are always different. Its only when string from same cycle can
a can two strings be identical and these will easer to deal with
since they would be shorter than buffer in most cases. My
current compare functions don't use this info so slower than could
be.

You could sort each cycle indepently and then merge the results
since the order of each row is sane within a cycle either from
big sort or seperate cyclle sorts. I chose the way I did for ease
of
understanding. Note sorting is at best an n log n time function a
string of 8 character 8*3 or time 24 a string of 16 would be 16*4
or 64 so 2 strings of 8 versus 1 string of 16 woulf be like
48 versus 64 I hope you get the point. The speed problem is
not settled.

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"
.

Relevant Pages

  • One more "strlen" - was: Note to Chuck Crayne
    ... optimize strlen to shave one cycle off it, and you distribute your library to 1000 users, and they each write a program that uses strlen 1000 times, and distribute it to 1000 end-users, and they each run it ... We would of course only do strlen once per string, so we have to imagine we've got a lot of strings being thrown at us. ... When I click on the little hieroglyph to "sort by thread" instead of "sort by date", it takes - by wall clock - approximately a minute and fifteen seconds to complete. ... A better approach would be to keep a running index table for every column the user can sort by and every index table should be updated every time Thunderbird recieves an email/post...this way, the click on the glyph merrly selects which index table to use when picking what message headings to show in the window -- no need to run no freak'n algo. ...
    (alt.lang.asm)
  • Re: Fast string functions
    ... appropriate alignment of the static strings using language ... short strings, but perhaps a generic instruction-based while loop will ... is as slow as its direct replacement based on test/jnz. ... cycle, or unrolled it in time. ...
    (comp.arch)
  • Re: Serial = Random ?
    ... bit has a cycle of length 4, the next higher a cycle of length 8, etc. ... Long bit strings give very long cycles. ... composition with long cycle length looks a bit like a ... All this shows is that a segment of a serial composition may sound ...
    (rec.music.theory)
  • Creating an array of strings
    ... How do I create a list of strings that I can cycle thru via a for loop ... I can't get the syntax right, not being much of a VB ...
    (microsoft.public.excel.programming)
  • Re: My First Lesson
    ... Hey this may be useful. ... If you already know the cycle of 5ths, as you move across the strings ... string 5th fret = G). ...
    (alt.guitar.beginner)