Title | DOI | Year | Month | type |
---|---|---|---|---|
Improved Upper Bounds on the Average Redundancy of Optimal RVLC | - | 1402 | 10 | Journal |
On the Shortest Codeword of the Optimal RVLC | - | 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 | - | 1394 | 08 | Journal |
The Most Likely Optimal Symmetric RVLC | - | 1394 | 08 | Journal |
The Redundancy of an Optimal Binary Fix-free Code Is not Greater than 1 Bit | - | 1394 | 03 | Journal |
On the Penalty of Optimal Fix-Free Codes | - | 1394 | 02 | Journal |
On the Source-Channel Separation Theorem for Infinite Source Alphabets | - | 1394 | 01 | Journal |
Weakly Symmetric Fix-free Codes | - | 1393 | 06 | Journal |