Abeni Codes
رفتن به کانال در Telegram
I post about my insights, new discoveries, projects and advices related to tech mainly and other topics once in a while. You can DM me @abeni_al7 for professional or collaborative queries.
نمایش بیشتر163
مشترکین
اطلاعاتی وجود ندارد24 ساعت
+17 روز
+330 روز
در حال بارگیری داده...
کانالهای مشابه
هیچ دادهای
مشکلی وجود دارد؟ لطفاً صفحه را تازه کنید یا با مدیر پشتیبانی ما تماس بگیرید.
ابر برچسبها
اشارات ورودی و خروجی
---
---
---
---
---
---
جذب مشترکین
ژوئیه '26
ژوئیه '26
+5
در 1 کانالها
ژوئن '26
+8
در 0 کانالها
Get PRO
مه '26
+8
در 0 کانالها
Get PRO
آوریل '26
+49
در 0 کانالها
Get PRO
مارس '26
+8
در 1 کانالها
Get PRO
فوریه '26
+8
در 0 کانالها
Get PRO
ژانویه '260
در 0 کانالها
Get PRO
دسامبر '25
+2
در 0 کانالها
Get PRO
نوامبر '25
+3
در 0 کانالها
Get PRO
اکتبر '25
+1
در 0 کانالها
Get PRO
سپتامبر '25
+1
در 0 کانالها
Get PRO
اوت '250
در 0 کانالها
Get PRO
ژوئیه '250
در 0 کانالها
Get PRO
ژوئن '25
+1
در 0 کانالها
Get PRO
مه '25
+5
در 0 کانالها
Get PRO
آوریل '25
+8
در 0 کانالها
Get PRO
مارس '25
+4
در 0 کانالها
Get PRO
فوریه '25
+5
در 0 کانالها
Get PRO
ژانویه '25
+10
در 0 کانالها
Get PRO
دسامبر '24
+73
در 0 کانالها
| تاریخ | رشد مشترکین | اشارات | کانالها | |
| 31 ژوئیه | 0 | |||
| 30 ژوئیه | +1 | |||
| 29 ژوئیه | 0 | |||
| 28 ژوئیه | 0 | |||
| 27 ژوئیه | 0 | |||
| 26 ژوئیه | 0 | |||
| 25 ژوئیه | 0 | |||
| 24 ژوئیه | 0 | |||
| 23 ژوئیه | 0 | |||
| 22 ژوئیه | 0 | |||
| 21 ژوئیه | 0 | |||
| 20 ژوئیه | 0 | |||
| 19 ژوئیه | 0 | |||
| 18 ژوئیه | 0 | |||
| 17 ژوئیه | 0 | |||
| 16 ژوئیه | 0 | |||
| 15 ژوئیه | 0 | |||
| 14 ژوئیه | 0 | |||
| 13 ژوئیه | +3 | |||
| 12 ژوئیه | 0 | |||
| 11 ژوئیه | 0 | |||
| 10 ژوئیه | 0 | |||
| 09 ژوئیه | 0 | |||
| 08 ژوئیه | +1 | |||
| 07 ژوئیه | 0 | |||
| 06 ژوئیه | 0 | |||
| 05 ژوئیه | 0 | |||
| 04 ژوئیه | 0 | |||
| 03 ژوئیه | 0 | |||
| 02 ژوئیه | 0 | |||
| 01 ژوئیه | 0 |
پستهای کانال
| 2 | I built Lacon, a huffman coding based text file compression tool. I used Go to build it and it taught me a lot of things and made me see some of the theoretical concepts I knew in practice.
Compression is an amazing concept to learn in practice. It made me appreciate the cleverness of the people that come up with algorithms that solve very specific problems in a very efficient way.
Huffman coding has a few basic steps. It scans the file, counts the frequency of each character in the file, and assigns shorter binary codes for the most frequent ones and longer codes to the least frequent ones. Compared to giving the same 8-bit length representation for all characters in a file, this results in a significantly lower file size. The significance of the compression totally depends on the distribution of characters in the text file.
While building this tool I used:
- Min-heaps to efficiently build the Huffman tree which is a special binary tree which has the most frequent characters at a shallower depth than the rarer ones.
- Binary trees to generate prefix codes that would be decoded unambiguously.
- Bit level I/O to read and write individual bits when compressing and decompressing which was admottedly the most challenging part for me.
My code is public on GitHub for anyone who wants to look at it and give me feedback (https://github.com/abeni-al7/lacon). I have also built a CLI and a web interface so that it is easy to access it and try it out (https://lacon-jet.vercel.app/). | 683 |
| 3 |  @backendlife | 156 |
| 4 |  بدون متن... | 135 |
| 5 |  Is the interview process for other roles really just convo and stuff? | 142 |
| 6 |  بدون متن... | 154 |
