I am stunned at the number of responses that imply that such a thing is impossible. Have these people never heard of “compressed file systems”, which have been around since before Microsoft was sued in 1993 by Stac Electronics over compressed file system technology? I hear that LZS and LZJB are popular algorithms for people … Read more
FILE *fileptr; char *buffer; long filelen; fileptr = fopen(“myfile.txt”, “rb”); // Open the file in binary mode fseek(fileptr, 0, SEEK_END); // Jump to the end of the file filelen = ftell(fileptr); // Get the current byte offset in the file rewind(fileptr); // Jump back to the beginning of the file buffer = (char *)malloc(filelen * … Read more
Since you already have to implement code to handle a bit-wise layer on top of your byte-organized stream/file, here’s my proposal. Do not store the actual frequencies, they’re not needed for decoding. You do, however, need the actual tree. So for each node, starting at root: If leaf-node: Output 1-bit + N-bit character/byte If not … Read more