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.