Results 1 to 8 of 8

Thread: Idea - Don't flame me pls...

  1. #1
    Member
    Join Date
    Apr 2009
    Location
    USA
    Posts
    5
    Thanks
    0
    Thanked 0 Times in 0 Posts

    Idea - Don't flame me pls...

    Okay now I am not sure if this is a good idea or not but what if you were to just xor all the letters one at a time (each letter having a specific XOR making all the letters equal the same thing) to make them all the same letters and then do as follows like bwt does example (award=aaaaa=a4). That way all characters that are printable can be compressed (besides spaces and new lines to preserve the file format) would this be a possible text compression technic? I know I am not a advanced enough programmer to do this yet but I will make it my next project to atleast try. Anyways tell me what you think?

    And example could be seen here http://guymal.com/mycode/xor_js_encryption/ taking the required xor for each letter making all the letters the same yet still maintaining file format?

    Also note the decryption part of the program would hold the specific xor's used to undo it all and restore the file?

    P.S. You neccasarily dont have to xor each entry you could always implement switch statements for each letter and then increment the letter till its the specific one.
    Last edited by rubendodge; 24th April 2009 at 05:55.

  2. #2
    Member
    Join Date
    Apr 2009
    Location
    USA
    Posts
    5
    Thanks
    0
    Thanked 0 Times in 0 Posts
    Okay I thought about it and finally found some very good reasonw hy this idea wouldnt work. Who knows maybe someone who knows more about this stuff can find a way to make it work and can develop a new improved text compression algorithm lol.

  3. #3
    Administrator Shelwien's Avatar
    Join Date
    May 2008
    Location
    Kharkov, Ukraine
    Posts
    3,377
    Thanks
    215
    Thanked 1,024 Times in 545 Posts
    There's a common technique called "dictionary preprocessing" that does something similar.
    Also some comparisons take into account the decompressor size
    (thus sizes of sfx archives are effectively compared) and in such
    cases the possible gain from such methods is very limited.
    Well, you always can "compress" the file into its ed2k hash or something.

  4. #4
    Member
    Join Date
    Aug 2008
    Location
    Saint Petersburg, Russia
    Posts
    215
    Thanks
    0
    Thanked 0 Times in 0 Posts
    Yeah but there will be one or two issues with decompressing it back

  5. #5
    Administrator Shelwien's Avatar
    Join Date
    May 2008
    Location
    Kharkov, Ukraine
    Posts
    3,377
    Thanks
    215
    Thanked 1,024 Times in 545 Posts
    Why, you can't really do anything anymore without internet access.
    Just give your archive an attactive-looking name, and it would be shared
    on p2p forever...

  6. #6
    Tester
    Black_Fox's Avatar
    Join Date
    May 2008
    Location
    [CZE] Czechia
    Posts
    471
    Thanks
    26
    Thanked 9 Times in 8 Posts
    I wouldn't be so sure with current avalanche of TPB-process-related threatening to torrent portals.
    As to comment to the idea, this would change nothing (original file changed into A's and then database containing original characters, effectively equal to the original file).
    I am... Black_Fox... my discontinued benchmark
    "No one involved in computers would ever say that a certain amount of memory is enough for all time? I keep bumping into that silly quotation attributed to me that says 640K of memory is enough. There's never a citation; the quotation just floats like a rumor, repeated again and again." -- Bill Gates

  7. #7
    The Founder encode's Avatar
    Join Date
    May 2006
    Location
    Moscow, Russia
    Posts
    3,982
    Thanks
    377
    Thanked 351 Times in 139 Posts
    Yep, the encoder should accurately predict the next character to xor with. If we predict ALL characters correctly we may output a file with zeroes - thus indicating the number of input characters. In particular way, we may compress file into a few bytes - indicating the input size with one integer... As example, if we compress the pseudo random number generator output and we KNOW the algorithm, we may do such thing here.
    Yet another crazy idea is to use "the predictor" algorithm idea, but instead of dropping flags - predicted/mispredicted+char we may just xor with a guessed char. Anyway, I tested the idea, and in practice this not helps...

  8. #8
    Member
    Join Date
    Apr 2009
    Location
    USA
    Posts
    5
    Thanks
    0
    Thanked 0 Times in 0 Posts
    wow oh well it seemed like a good idea at the time but I guess the other methods you guys use would definatly be more effective and less problematic. Anyways btw encode I like ur site.

Similar Threads

  1. Idea: Combine Compression & Encryption
    By dirks in forum Data Compression
    Replies: 16
    Last Post: 22nd February 2010, 11:49
  2. Compression idea: Base conversion
    By Nightgunner5 in forum Data Compression
    Replies: 8
    Last Post: 30th October 2009, 08:58
  3. Idea to make new site about data compression
    By Piotr Tarsa in forum Data Compression
    Replies: 1
    Last Post: 14th August 2009, 21:22
  4. New Idea for Hybrid 7-Zip Archiver
    By DeathTheSheep in forum Data Compression
    Replies: 22
    Last Post: 30th December 2008, 22:57
  5. Don Lewis
    By encode in forum Forum Archive
    Replies: 1
    Last Post: 17th October 2006, 14:31

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •