پديد آورنده :
يارمحمدي، ليلي
عنوان :
ساخت كدهاي شبه رابين خوب
مقطع تحصيلي :
كارشناسي ارشد
گرايش تحصيلي :
رياضي كاربردي
محل تحصيل :
اصفهان : دانشگاه صنعتي اصفهان
صفحه شمار :
دوازده، 74ص.: مصور، جدول، نمودار
استاد راهنما :
مرتضي اسماعيلي
توصيفگر ها :
كدهاي شبه رابين , كدهاي كوشي دوري , كدهاي كوشي ريد-سولومن , كدهاي آرايه اي
استاد داور :
علي زاغيان، رضا سبحاني
تاريخ ورود اطلاعات :
1399/09/25
تاريخ ويرايش اطلاعات :
1399/10/03
چكيده انگليسي :
leili yarmohammadi L yarmohammadi@math iut ac ir September 19 2020 Master of Science Thesis in Farsi Departement of Mathematical Sciences Isfahan University of Technology Isfahan 84156 8311 IranSupervisor Dr Morteza Esmaili mesmaeili@cc iut ac ir2000 MSC 05C25 20B25 05C60Keywords MDS array codes Rabin like codes Cauchy Reed Solomon codes Circulant Cauchy codes Abstract This M Sc thesis is based on the following papers S H A New Construction and an efficient decoding method for Rabinlike codes IEEE H H Transactions on Communications vol 66 no 2 pp 521 533 February 31 2018 Array codes have been widely used in communication and storage systems To reduce computational complexity one important property of the array codes is that only exclusive OR operations are used in the encoding and de coding processes Cauchy Reed Solomon codes Rabin like codes and circulant Cauchy codes are existing Cauchymaximum distance separable MDS array codes that employ Cauchy matrices over nite elds circular permutationmatrices and circulant Cauchy matrices respectively All these codes can correct any number of failures how ever acriticaldrawbackof existing codes is the high decoding complexity In this work we propose a new constructionof Rabinlike codes based on a quotient ring with a cyclic structure The newly constructed Rabin like codes havemore supported parameters prime p is extended to an odd number such that the world sizes of them are more exi ble than the existing Cauchy MDS array codes An ef cient decoding method using LU factorization of the Cauchymatrix can be applied to the newly constructed Rabin like codes It is shown that the decoding complexity of theproposed approach is less than that of existing Cauchy MDS array codes Hence the Rabin like codes based on thenew construction are attractive to distributed storage systems
استاد راهنما :
مرتضي اسماعيلي
استاد داور :
علي زاغيان، رضا سبحاني
