پديد آورنده :
نريماني، حامد
عنوان :
بررسي افزونگي روش هاي كد گذاري بدون اتلاف بهينه و شبه بهينه منابع بدون حافظه با الفباي بزرگ
محل تحصيل :
اصفهان: دانشگاه صنعتي اصفهان، دانشكده برق و كامپيوتر
صفحه شمار :
يازده،113ص.نمودار
يادداشت :
ص.ع.به فارسي و انگليسي
استاد راهنما :
محمدعلي خسروي فرد
استاد مشاور :
فريد بهرامي
تاريخ نمايه سازي :
9/10/92
استاد داور :
حسين سعيدي، علي محمد دوست حسيني
دانشكده :
مهندسي برق و كامپيوتر
كد ايرانداك :
ID586 دكتري
چكيده فارسي :
به فارسي و انگليسي: قابل رويت در نسخه ديجيتالي
چكيده انگليسي :
On the Redundancy of Optimal and Suboptimal Lossless Coding Schemes for Memoryless Sources with Large Alphabet HamedNarimani narimani hh@ec iut ac ir Sep Department of Electrical and Computer Engineering Isfahan University of Technology Isfahan Iran Supervisor MohammadaliKhosravifard khosravi@cc iut ac ir Advisor FaridBahrami fbahrami@cc iut ac ir Department Graduate Program Coordinator Masood Omoomi Department of Electrical and Computer Engineering Isfahan University of Technology Department of Mathematical Sciences Isfahan University of Technology Abstract The performance of optimal and some suboptimal lossless prefix encoding schemes for memoryless sources with a large alphabet size are studied It is proved that the redundancy of the Huffman code for almost all sources with symbols is very close to that of the average distribution of the monotone sources with symbols This value lies between and bit for large Our results show that this is also the case with the M coding scheme in which all tuple sources with sorted probabilities are encoded by the optimal code for the average distribution of monotone sources with symbols Thus M coding is a near optimal code for most sources witha large alphabet Also it is shown that the redundancy of the Shannon code is very close to bit for most sources with symbols The redundancy of the Fixed length code Uniform code and SU coding scheme are also studied It is proved that approximated by some functions of the fraction part of log for the aforementioned encoding scheme the redundancy of most sources with symbols is very close to the average redundancy over the set of sources with symbols For a large alphabet size these values can be Key words Huffman code suboptimal coding monotone source average monotone source large alphabet PDF created with pdfFactory trial version www pdffactory com
استاد راهنما :
محمدعلي خسروي فرد
استاد مشاور :
فريد بهرامي
استاد داور :
حسين سعيدي، علي محمد دوست حسيني
