Articles

type: Journal
Title DOI Date
Near-Optimality of the Minimum Average Redundancy Code for Almost All Monotone Sources #
Reducing Interpolation Artifacts for Mutual Information Based Image Registration #
A Kraft-Type Sufficient Condition for the Existence of D-Ary Fix-Free Codes #
Encoding Finite Sources with Ranked Probabilities #
Extension of the Lasserre-Avrachenkov Theorem on the Integral of Multilinear Forms over the Simplices #
Confliction of the Convexity and Metric Properties in f-Divergences #
The Minimum Average Code for Finite Memoryless Monotone Sources #
ATree based Algorithm for Generating All Possible Binary Compact Codes with N Codewords #
توليد همه كدهاي فشرده با محدوديت روي كوچك ترين طول كد #
type: Conference
Title Date
Mutual information-based image template matching with small template size
Two Recursive Versions of the Shannon Code
Improving the Performance of LP Decoders for Cyclic Codes
On the Overall Performance of the Uniform Code
On the Capability of the Harada-Kobayashi Algorithm in Finding Fix-Free Codewords
The Overall Performance of the Shannon Code
The Supertree of the Compact Codes
Some Sufficient Conditions of the Existence of D-ary Fix-Free Codes
A Class of Average Distributions for Monotone Sources
گيرنده آشكارسازي چندكاربره با استفاده از برنامه ريزي خطي