u/abpolus2002 — reddlx

I want to learn more about Data Matrix Code and QR Code.

Hi, I am new here I am learning something new and experimenting with it. I asked myself why not possibly combine it like in my picture (I am learning how to make my custom reader using a camera too). Could someone reply to me what is maybe wrong with my custom 2D matrix barcode, what advantages it has and disadvantages, etc. I am awaiting your replies.

It can hold 4 data bytes with 4 error corrections bytes and its size is 12x12.

Red - finder pattern (black color)

Light / Dark Green - payload (data)

Yellow and Orange - error corrections (Reed-Solomon)

Pink - modes (4)

and Light Blue - quiet zone (white color, it help with finding orientation with finder pattern too)

u/abpolus2002 — 5 days ago

▲ 0 r/cryptography

Similar to RSA but based on multiplication and addition

Hi I am new to this community.

I have created something working like RSA but using multiplication and addition.

I am currently searching where I could test it more instead of using AI (ChatGPT) searching for errors. I want it to make it public too, but where should I put code and under what licence if needed. If you have any questions and I have time I will gladly answer them.

Thank you!

This is link to GitHub: https://github.com/abpolus/encryption_that_need_to_be_tested

u/abpolus2002 — 2 months ago

▲ 0 r/compression

My lossy compresion algorithm that work for me.

I have created this post written like that on stackexchange computer science, but it was closed.

Any idea what to make better - for this community here?

Introduction

Hi, i am new to compression algorithm, but i found a specific method that allowed to use binary number from 0 to 253 and can be as long as possible starting from 8^2*17 bytes. The compression allowe for any randomness of binary data. This method does not have any length indicator, but have 17 bits header and it can be decompressed from binary string.

Question

My question is, if there is any need for it if the compression ration maximal would be 1.138:1 and minimal 1:1?

How it works?

If you would have binary string created from "00110011", "10001111" and "10010011" with different amount of each binary number and length starting from 2^8**17, than the method take 2 most frequent numbers and change them to other numbers that can be compress (i will not metion specific numbers but it would compress for example: "00110011" to "10101"+padding(0s and 1s)). The header is based on 1 bit to find the beginning of the string and 2 frequent numbers. Decompression is also easy, it take 17 bits from beginning and read than rest of the binary string from end to beginning. Everything is than to the compression algorithm that have built-in dictionary for it.

Expectation

If my method is wrong or not possible, please join the conversation, it will help me and i will gladly appreciate it!

Additionally

It is very easy to convert it to lossless compression but the compression ration would be in range from 0.99931:1 to 1.130:1.

I will not share the code

reddit.com

u/abpolus2002 — 5 months ago