پديد آورنده :
منصوري، عصمت
عنوان :
كدشبكه هاي تصحيح كننده خطا
مقطع تحصيلي :
كارشناسي ارشد
گرايش تحصيلي :
رياضي كاربردي
محل تحصيل :
اصفهان: دانشگاه صنعتي اصفهان، دانشكده علوم رياضي
صفحه شمار :
ده، 89ص.: مصور
استاد راهنما :
مرتضي اسماعيلي
توصيفگر ها :
شبكه هاي بدون دور , كد شبكه خطي , كران يكاني , كران همينگ
تاريخ نمايه سازي :
1394/08/04
استاد داور :
حميدرضا مرزبان، محمدحسام تدين
تاريخ ورود اطلاعات :
1396/10/05
چكيده انگليسي :
Network error correcting codes Esmat Mansouri e mansourihabibabadi@math iut ac ir 2015 Department of Mathematical Sciences Isfahan University of Technology Isfahan 84156 83111 Iran Supervisor Dr Morteza Esmaeili emorteza@cc iut ac ir 2010 MSC 94B05 94B15 Keywords acyclic network network coding error correcting codes linear network code Singletonbound Hamming bound AbstractNetwork coding has been extensively studied for multicasting information in a directed communicationnetwork when communication links in the network are error free The network capacity for multicastsatis es the max ow min cut theorem and this capacity can be achieved by network coding In2006 network error correction NEC codes were introduced by Cai and Yeung For networks inwhich channels are not necessarily error free the mentioned author introduced the paradigm of NECcodes as a generalization of classical error correction A network code corrects t errors if every sinknode can recover the original information sent by the source node when t or less error occur atarbitrary edges Cai and Yeung also introduced the network generalizations of the Hamming boundand the Singleton bound in classical algebraic coding theory These bounds have been introduced onthe number of messages in the network error correcting codes that is not necessarily linear In this thesis we study the basic concepts of NEC as well as a framework for characterizing errorcorrection and error detection capabilities of NEC codes Moreover di erent minimum distances arede ned to measure error correction detection capabilities The error correction detection capabilitiesof a network code is completely characterized by a parameter which is equivalent to the minimumHamming distance when the network code is linear and the weight measure on the error vectors is theHamming weight These results point out that for a linear network code with the Hamming weightbeing the weight measure on the error vectors the capability of the code is fully characterized by asingle minimum distance We study a deterministic and centralized algorithm which constructs a NEC code that attains the
استاد راهنما :
مرتضي اسماعيلي
استاد داور :
حميدرضا مرزبان، محمدحسام تدين
