Show simple item record

dc.contributor.advisorPhelps, Kevin
dc.contributor.authorDelgado Ortiz, Abel
dc.date.accessioned2009-07-28T15:30:11Z
dc.date.available2009-07-28T15:30:11Z
dc.date.issued2009-07-28T15:30:11Z
dc.identifier.urihttp://hdl.handle.net/10415/1816
dc.description.abstractThe intersection problem for Coding Theory can be stated as follows: given a family or class of families of codes, find the spectrum of intersection numbers. The general strategy to attack this kind of problem begins by finding necessary conditions for the intersection. This leads to lower and upper bounds or a set of possible intersection numbers. Secondly, finding the sufficient conditions implies giving specific constructions of codes in such a way that the cardinality of their intersection fits those values between these bounds. In this dissertation is presented a complete solution of the intersection problem for the class of Reed-Muller codes.en
dc.rightsEMBARGO_NOT_AUBURNen
dc.subjectMathematics and Statisticsen
dc.titleIntersection problem for the class of Reed-Muller codes.en
dc.typedissertationen
dc.embargo.lengthNO_RESTRICTIONen_US
dc.embargo.statusNOT_EMBARGOEDen_US


Files in this item

Show simple item record