Show simple item record

dc.contributor.supervisorvan Rees, John (Computer Science)en_US
dc.contributor.authorNasr Esfahani, Navid
dc.date.accessioned2014-08-21T22:32:39Z
dc.date.available2014-08-21T22:32:39Z
dc.date.issued2014-08-21
dc.identifier.urihttp://hdl.handle.net/1993/23843
dc.description.abstractBalanced Incomplete Block Designs and Binary Linear Codes are two combinatorial designs. Due to the vast application of codes in communication the field of coding theory progressed more rapidly than many other fields of combinatorial designs. On the other hand, Block Designs are applicable in statistics and designing experiments in different fields, such as biology, medicine, and agriculture. Finding the relationship between instances of these two designs can be useful in constructing instances of one from the other. Applying the properties of codes to corresponding instances of Balanced Incomplete Block Designs has been used previously to show the non-existence of some designs. In this research the relationship between (16,6,3)-designs and (25,12) codes was determined.en_US
dc.language.isoengen_US
dc.rightsinfo:eu-repo/semantics/openAccess
dc.subjectBalanced incomplete block designsen_US
dc.subjectSelf-orthogonal codesen_US
dc.titleThe relationship between (16,6,3)-balanced incomplete block designs and (25,12) self-orthogonal codesen_US
dc.typeinfo:eu-repo/semantics/masterThesis
dc.typemaster thesisen_US
dc.degree.disciplineComputer Scienceen_US
dc.contributor.examiningcommitteeBate, John (Computer Science) Li, Ben (Computer Science) Kinsner, Witold (Electrical and Computer Engineering)en_US
dc.degree.levelMaster of Science (M.Sc.)en_US
dc.description.noteOctober 2014en_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record