پديد آورنده :
مقدسي، فرشته
عنوان :
ساخت يك دسته از كدهاي دوري و شبه دوري بدون دور چهار و مجموعه هاي تله اي كوچك
مقطع تحصيلي :
كارشناسي ارشد
گرايش تحصيلي :
رياضي كاربردي
محل تحصيل :
اصفهان: دانشگاه صنعتي اصفهان، دانشكده علوم رياضي
صفحه شمار :
نه،76ص.: جدول،نمودار
يادداشت :
ص.ع.به فارسي و انگليسي
استاد راهنما :
مرتضي اسماعيلي
توصيفگر ها :
تجزيه دوري , كد هندسه-متناهي﴿FG) , كدLDPC , جمع بررسي - توازن متعامد , سطر و ستون- محدوديت(RC) , مجموعه تله اي , كد شبه دوري﴿QC)
تاريخ نمايه سازي :
20/1/93
استاد داور :
حميدرضا مرزبان، محمد حسام تدين
چكيده فارسي :
به فارسي و انگليسي: قابل رويت در نسخه ديجيتالي
چكيده انگليسي :
A Class of RC Constraint Cyclic and QC LDPC Codes Free of Small Trapping Sets Fereshteh Moghadasi f moghadasi@math iut ac ir 2014 Department of Mathematical Sciences Isfahan University of Technology Isfahan 84156 83111 Iran Supervisor Dr Morteza Esmaeili emorteza@cc iut ac ir Advisor Dr Ali zaghian ali zaghian1338@yahoo com 2010 MSC 94B05 68P30 Keywords Circulant decomposition cyclic code nite geometry FG code low dencity parity check LDPC code quasi cyclic QC code row column RC constrained LDPC code trapping set AbstractIn this thesis a family of cyclic and quasi cyclic codes is derived from a given cyclic code In particular families of cyclic LDPC codes are constructed Let Fq be the eld with q elements where q is a power of a prime A LDPC code is the null spaceof a low density parity check matrix H over Fq A given LDPC code is called regular q ary if Hhas constant column weight and constant row weight otherwise it is called irregular q ary LDPCcode If H is an array of sparse circulants of the same size over Fq then the code is called a q aryquasi cyclic QC LDPC code If H is a sparse circulant or a column of sparse circulant of the samesize over Fq then the code is called a cyclic LDPC code In most of the proposed constructoin methods for LDPC code the following constraint on the rowsand columns of H is imposed no two rows or two columns are simultaneously nonzero in more thanone coordinate This property is referred to as the row column RC constraint The RC constraintensures that the girth of the Tanner graph representing H is greater than four and the minimumdistance of the code is at least 1 There are a common weakness with LDPC codes known as error oor when decoded with iterativedecoding algorithm The existence of error oor is due to the existence of an undesirable structure in
استاد راهنما :
مرتضي اسماعيلي
استاد داور :
حميدرضا مرزبان، محمد حسام تدين
