The web site is www.complimentaryware.unaux.com . I have an excellent method on
PDF, an unpublished research of my own but this newsgroup does not allow attachments.
I started coding but shelved it and put it in the background since l
am also simultaneously developing and coding other s/w as well. But
why do you ask ? I am quite certain there is nothing wrong with the
method.
The web site is www.complimentaryware.unaux.com . I have an excellent method on
PDF, an unpublished research of my own but this newsgroup does not
allow attachments.
On 2020-06-10 14:03:08 +0000, sundaresh.venugopal@gmail.com said:
The web site is www.complimentaryware.unaux.com . I have an excellent method on
PDF, an unpublished research of my own but this newsgroup does not
allow attachments.
You can always attach it if you use a newsreader instead of the Google
Groups interface (that also puts your IP in the headers by the way).
Don't do it however since all the free newsservers won't be able to
hold your post thus reducing the visibility and reach. Instead, upload
it to a website like WeTransfer and post the link in the newsgroup.
Good research though! Look forward to learning more.
In comp.compression, <sundaresh.venugopal@gmail.com> wrote:
I started coding but shelved it and put it in the background since l
am also simultaneously developing and coding other s/w as well. But
why do you ask ? I am quite certain there is nothing wrong with the
method.
This group is littered with the dead claims of people who said they had
a better compression method but could never prove it with code.
Elijah
------
"compression" seems to attrack kooks as much as "perpetual motion"
In comp.compression, <sundaresh.venugopal@gmail.com> wrote:
I started coding but shelved it and put it in the background since l
am also simultaneously developing and coding other s/w as well. But
why do you ask ? I am quite certain there is nothing wrong with the
method.
This group is littered with the dead claims of people who said they had
a better compression method but could never prove it with code.
In comp.compression, <sundaresh.venugopal@gmail.com> wrote:
I started coding but shelved it and put it in the background since l
am also simultaneously developing and coding other s/w as well. But
why do you ask ? I am quite certain there is nothing wrong with the
method.
This group is littered with the dead claims of people who said they had
a better compression method but could never prove it with code.
Elijah
------
"compression" seems to attrack kooks as much as "perpetual motion"
The web site is www.complimentaryware.unaux.com . I have an excellent method on
PDF, an unpublished research of my own but this newsgroup does not
allow attachments.
You can always attach it if you use a newsreader instead of the Google Groups interface (that also puts your IP in the headers by the way).
Don't do it however since all the free newsservers won't be able to
hold your post thus reducing the visibility and reach. Instead, upload
it to a website like WeTransfer and post the link in the newsgroup.
Good research though! Look forward to learning more.
Well thanks ! One encouraging response . Here is the link
https://drive.google.com/file/d/1w5sNV_YVM9XGymz8A0MT0V_cubxMPYCM/view?usp=sharing
If it does not work, let me know.
Den torsdag 18 juni 2020 kl. 05:59:27 UTC+2 skrev sundaresh...@gmail.com:
The web site is www.complimentaryware.unaux.com . I have an excellent method on
PDF, an unpublished research of my own but this newsgroup does not allow attachments.
You can always attach it if you use a newsreader instead of the Google Groups interface (that also puts your IP in the headers by the way). Don't do it however since all the free newsservers won't be able to
hold your post thus reducing the visibility and reach. Instead, upload
it to a website like WeTransfer and post the link in the newsgroup.
Good research though! Look forward to learning more.
Well thanks ! One encouraging response . Here is the link
https://drive.google.com/file/d/1w5sNV_YVM9XGymz8A0MT0V_cubxMPYCM/view?usp=sharing
If it does not work, let me know.
It doesn't work.
On Thursday, July 2, 2020 at 7:08:23 PM UTC+5:30, icep...@gmail.com wrote:
Den torsdag 18 juni 2020 kl. 05:59:27 UTC+2 skrev sundaresh...@gmail.com:
The web site is www.complimentaryware.unaux.com . I have an excellent method on
PDF, an unpublished research of my own but this newsgroup does not allow attachments.
You can always attach it if you use a newsreader instead of the Google Groups interface (that also puts your IP in the headers by the way). Don't do it however since all the free newsservers won't be able to hold your post thus reducing the visibility and reach. Instead, upload it to a website like WeTransfer and post the link in the newsgroup.
Good research though! Look forward to learning more.
Well thanks ! One encouraging response . Here is the link
https://drive.google.com/file/d/1w5sNV_YVM9XGymz8A0MT0V_cubxMPYCM/view?usp=sharing
If it does not work, let me know.
It doesn't work.
Really, have you tried coding it. If you have, can I see the code ? You can do just what I have done. In the meantime I have made significant improvements to it, and it should be visible in the link and I will be coding this new version.
On Thursday, July 2, 2020 at 7:08:23 PM UTC+5:30, icep...@gmail.com wrote:
Den torsdag 18 juni 2020 kl. 05:59:27 UTC+2 skrev sundaresh...@gmail.com:
The web site is www.complimentaryware.unaux.com . I have an excellent method on
PDF, an unpublished research of my own but this newsgroup does not allow attachments.
You can always attach it if you use a newsreader instead of the Google Groups interface (that also puts your IP in the headers by the way). Don't do it however since all the free newsservers won't be able to hold your post thus reducing the visibility and reach. Instead, upload it to a website like WeTransfer and post the link in the newsgroup.
Good research though! Look forward to learning more.
Well thanks ! One encouraging response . Here is the link
https://drive.google.com/file/d/1w5sNV_YVM9XGymz8A0MT0V_cubxMPYCM/view?usp=sharing
If it does not work, let me know.
It doesn't work.
Really, have you tried coding it. If you have, can I see the code ? You can do just what I have done. In the meantime I have made significant improvements to it, and it should be visible in the link and I will be coding this new version.
Den fredag 3 juli 2020 kl. 05:38:42 UTC+2 skrev sundaresh...@gmail.com:S.
On Thursday, July 2, 2020 at 7:08:23 PM UTC+5:30, icep...@gmail.com wrote:
Den torsdag 18 juni 2020 kl. 05:59:27 UTC+2 skrev sundaresh...@gmail.com:
The web site is www.complimentaryware.unaux.com . I have an excellent method on
PDF, an unpublished research of my own but this newsgroup does not allow attachments.
You can always attach it if you use a newsreader instead of the Google
Groups interface (that also puts your IP in the headers by the way). Don't do it however since all the free newsservers won't be able to hold your post thus reducing the visibility and reach. Instead, upload
it to a website like WeTransfer and post the link in the newsgroup.
Good research though! Look forward to learning more.
Well thanks ! One encouraging response . Here is the link
https://drive.google.com/file/d/1w5sNV_YVM9XGymz8A0MT0V_cubxMPYCM/view?usp=sharing
If it does not work, let me know.
It doesn't work.
Really, have you tried coding it. If you have, can I see the code ? You can do just what I have done. In the meantime I have made significant improvements to it, and it should be visible in the link and I will be coding this new version.Please post the code you have then, and the results.
You are the one making a claim that a large number M can be written as a smaller number S by transforming it in one of several ways, which the pigeonhole principle will show anyone will not work for all numbers from 0 to M, since they can't all fit in
You can find S numbers out of M that do, but even selecting which set of Ses is out of the set 0->M will cost bits.I will see what I an do.
On Friday, July 3, 2020 at 6:58:11 PM UTC+5:30, icep...@gmail.com wrote:in S.
Den fredag 3 juli 2020 kl. 05:38:42 UTC+2 skrev sundaresh...@gmail.com:
On Thursday, July 2, 2020 at 7:08:23 PM UTC+5:30, icep...@gmail.com wrote:
Den torsdag 18 juni 2020 kl. 05:59:27 UTC+2 skrev sundaresh...@gmail.com:
The web site is www.complimentaryware.unaux.com . I have an excellent method on
PDF, an unpublished research of my own but this newsgroup does not
allow attachments.
You can always attach it if you use a newsreader instead of the Google
Groups interface (that also puts your IP in the headers by the way).
Don't do it however since all the free newsservers won't be able to
hold your post thus reducing the visibility and reach. Instead, upload
it to a website like WeTransfer and post the link in the newsgroup.
Good research though! Look forward to learning more.
Well thanks ! One encouraging response . Here is the link
https://drive.google.com/file/d/1w5sNV_YVM9XGymz8A0MT0V_cubxMPYCM/view?usp=sharing
If it does not work, let me know.
It doesn't work.
Really, have you tried coding it. If you have, can I see the code ? You can do just what I have done. In the meantime I have made significant improvements to it, and it should be visible in the link and I will be coding this new version.Please post the code you have then, and the results.
You are the one making a claim that a large number M can be written as a smaller number S by transforming it in one of several ways, which the pigeonhole principle will show anyone will not work for all numbers from 0 to M, since they can't all fit
Sorry. Meant, I will see what I can do, but not to convince people like you.You can find S numbers out of M that do, but even selecting which set of Ses is out of the set 0->M will cost bits.I will see what I an do.
in S.Please post the code you have then, and the results.
You are the one making a claim that a large number M can be written as a smaller number S by transforming it in one of several ways, which the pigeonhole principle will show anyone will not work for all numbers from 0 to M, since they can't all fit
Sorry. Meant, I will see what I can do, but not to convince people like you.You can find S numbers out of M that do, but even selecting which set of Ses is out of the set 0->M will cost bits.I will see what I an do.
fit in S.Please post the code you have then, and the results.
You are the one making a claim that a large number M can be written as a smaller number S by transforming it in one of several ways, which the pigeonhole principle will show anyone will not work for all numbers from 0 to M, since they can't all
number when you take all possible combinations into account.I am not expecting you to do any work for me, I was suggesting you do the work for *you*, so you see how it does, or does not work for any numbers or all numbers.Sorry. Meant, I will see what I can do, but not to convince people like you.You can find S numbers out of M that do, but even selecting which set of Ses is out of the set 0->M will cost bits.I will see what I an do.
It is quite common for people to assume things like "I can find my wanted large number in the decimals of PI and will refer to it by its position" which is true, but is not usable for compression since the pointer will be as long, or longer than the
If you are only envisioning "I will look for the number 141592653589" then yes, you can find a very short index for it. If you instead look for the far shorter number "93774" then it will not appear in the first 100000 digits.idea to know when it will *not* work.
So what you need to do in order to create fame for yourself with a new novel way of compressing data is 1) understand the pigeon hole principle (everyone in compression research must understand this one) and 2) make some kind of implementation of your
Good compressors work on something like 1% of the inputs, they just chose the 1% which are commonly found in files on computers. For all the 99% other kinds of data which are uncommon, they will expand, but if you don't hand such data to yourcompressor, noone notices and all is fine.
So by making the implementation, you have a good chance of finding out what your "99%" are.I am not the one making a false claim here. Do not mislead people.
Compression for many files seems to be part-way between LZ4 and Deflate.
Note that, like LZ4, it is byte oriented with no entropy coding.
<--
BtRP2 (Transposed, LE):
* dddddddd-dlllrrr0 (l=3..10, d=0..511, r=0..7)
* dddddddd-dddddlll-lllrrr01 (l=4..67, d=0..8191)
* dddddddd-dddddddd-dlllllll-llrrr011 (l=4..515, d=0..131071)
* rrrr0111 (Raw Bytes, r=(r+1)*8, 8..128)
* * rrr01111 (Long Match)
* rr011111 (r=1..3 bytes, 0=EOB)
* rrrrrrrr-r0111111 (Long Raw, r=(r+1)*8, 8..4096)
** d: Distance
** l: Match Length
** r: Literal Length
Values are encoded in little-endian order, with tag bits located in the
LSB. Bits will be contiguous within the value, with shift-and-mask being
used to extract individual elements.
On Wednesday, August 19, 2020 at 10:29:45 PM UTC+5:30, icep...@gmail.com wrote:fit in S.
Please post the code you have then, and the results.
You are the one making a claim that a large number M can be written as a smaller number S by transforming it in one of several ways, which the pigeonhole principle will show anyone will not work for all numbers from 0 to M, since they can't all
So by making the implementation, you have a good chance of finding out what your "99%" are.I am not the one making a false claim here. Do not mislead people.
BGB wrote on 18th June 2020 at 21:39:13 UTC+2:
Compression for many files seems to be part-way between LZ4 and Deflate.
Note that, like LZ4, it is byte oriented with no entropy coding.
<--
BtRP2 (Transposed, LE):
* dddddddd-dlllrrr0 (l=3..10, d=0..511, r=0..7)
* dddddddd-dddddlll-lllrrr01 (l=4..67, d=0..8191)
* dddddddd-dddddddd-dlllllll-llrrr011 (l=4..515, d=0..131071)
* rrrr0111 (Raw Bytes, r=(r+1)*8, 8..128)
* * rrr01111 (Long Match)
* rr011111 (r=1..3 bytes, 0=EOB)
* rrrrrrrr-r0111111 (Long Raw, r=(r+1)*8, 8..4096)
** d: Distance
** l: Match Length
** r: Literal Length
Values are encoded in little-endian order, with tag bits located in the
LSB. Bits will be contiguous within the value, with shift-and-mask being
used to extract individual elements.
Interesting tokens! You're using unary coding for the different tokens. In the last one (Long Raw) you might switch the 0 for another r bit, as a limit on code length (6 bits, 111111) would be enough to differentiate the last 2 cases.
I guess with some effort (PhD thesis), one could develop a method to formally describe all possible token variants via a grammar. And based on that, both the efficiency and the decoder complexity could be calculated and optimized.
| Sysop: | Keyop |
|---|---|
| Location: | Huddersfield, West Yorkshire, UK |
| Users: | 433 |
| Nodes: | 16 (2 / 14) |
| Uptime: | 96:47:02 |
| Calls: | 9,100 |
| Calls today: | 3 |
| Files: | 13,418 |
| Messages: | 6,028,630 |