|
Equal Forward and Backward Decoders with a Low Redundancy
|
|
|
IEEE TRANSACTIONS ON COMMUNICATIONS
|
|
توليد همه كدهاي فشرده با محدوديت روي كوچك ترين طول كد
|
# |
|
|
|
Improved Upper Bounds on the Average Redundancy of Optimal RVLC
|
# |
|
|
|
On the Shortest Codeword of the Optimal RVLC
|
# |
|
|
|
Some Tight Lower Bounds on the Redundancy of Optimal Binary Prefix-Free and Fix-Free Codes
|
10.1109/TIT.2020.2987309 |
|
|
|
A New Code for Encoding All Monotone Sources With a Fixed Large Alphabet Size
|
10.1109/TIT.2020.2965821 |
|
|
|
Optimal Codes with Limited Kraft Sum
|
# |
|
|
|
The Most Likely Optimal Symmetric RVLC
|
# |
|
|
|
The Redundancy of an Optimal Binary Fix-free Code Is not Greater than 1 Bit
|
# |
|
|
|
On the Penalty of Optimal Fix-Free Codes
|
# |
|
|
|
On the Source-Channel Separation Theorem for Infinite Source Alphabets
|
# |
|
|
|
Weakly Symmetric Fix-free Codes
|
# |
|
|
|
Sequentially-Constructible Reversible Variable Length Codes
|
# |
|
|
|
On the Structure of the Minimum Average Redundancy Code for Monotone Sources
|
# |
|
|
|
Huffman Redundancy for Large Alphabet Sources
|
# |
|
|
|
Including the Size of Regions in Image Segmentation by Region-Based Graph
|
# |
|
|
|
Bounds on Throughput of CSMA in Weibull Fading Channels
|
# |
|
|
|
93 of the 3/4-Conjecture Is Already Verified
|
# |
|
|
|
How Suboptimal is the Shannon Code
|
# |
|
|
|
Some Upper Bounds on the Redundancy of Optimal Binary Fix-Free Codes
|
# |
|
|