| توليد همه كدهاي فشرده با محدوديت روي كوچك ترين طول كد |
NULL |
1402 |
11 |
Journal |
| Improved Upper Bounds on the Average Redundancy of Optimal RVLC |
NULL |
1402 |
10 |
Journal |
| On the Shortest Codeword of the Optimal RVLC |
NULL |
1402 |
04 |
Journal |
| Some Tight Lower Bounds on the Redundancy of Optimal Binary Prefix-Free and Fix-Free Codes |
10.1109/TIT.2020.2987309 |
1399 |
04 |
Journal |
| A New Code for Encoding All Monotone Sources With a Fixed Large Alphabet Size |
10.1109/TIT.2020.2965821 |
1398 |
12 |
Journal |
| Optimal Codes with Limited Kraft Sum |
NULL |
1394 |
08 |
Journal |
| The Most Likely Optimal Symmetric RVLC |
NULL |
1394 |
08 |
Journal |
| The Redundancy of an Optimal Binary Fix-free Code Is not Greater than 1 Bit |
NULL |
1394 |
03 |
Journal |
| On the Penalty of Optimal Fix-Free Codes |
NULL |
1394 |
02 |
Journal |
| On the Source-Channel Separation Theorem for Infinite Source Alphabets |
NULL |
1394 |
01 |
Journal |
| Weakly Symmetric Fix-free Codes |
NULL |
1393 |
06 |
Journal |
| Sequentially-Constructible Reversible Variable Length Codes |
NULL |
1393 |
05 |
Journal |
| Huffman Redundancy for Large Alphabet Sources |
NULL |
1393 |
01 |
Journal |
| On the Structure of the Minimum Average Redundancy Code for Monotone Sources |
NULL |
1393 |
01 |
Journal |
| Including the Size of Regions in Image Segmentation by Region-Based Graph |
NULL |
1392 |
11 |
Journal |
| Bounds on Throughput of CSMA in Weibull Fading Channels |
NULL |
1392 |
09 |
Journal |
| 93 of the 3/4-Conjecture Is Already Verified |
NULL |
1392 |
09 |
Journal |
| How Suboptimal is the Shannon Code |
NULL |
1391 |
10 |
Journal |
| Some Upper Bounds on the Redundancy of Optimal Binary Fix-Free Codes |
NULL |
1391 |
03 |
Journal |
| A Simple Recursive Shannon Code |
NULL |
1390 |
11 |
Journal |