The relationship between (16,6,3)-balanced incomplete block designs and (25,12) self-orthogonal codes
dc.contributor.author | Nasr Esfahani, Navid | |
dc.contributor.examiningcommittee | Bate, John (Computer Science) Li, Ben (Computer Science) Kinsner, Witold (Electrical and Computer Engineering) | en_US |
dc.contributor.supervisor | van Rees, John (Computer Science) | en_US |
dc.date.accessioned | 2014-08-21T22:32:39Z | |
dc.date.available | 2014-08-21T22:32:39Z | |
dc.date.issued | 2014-08-21 | |
dc.degree.discipline | Computer Science | en_US |
dc.degree.level | Master of Science (M.Sc.) | en_US |
dc.description.abstract | Balanced 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.description.note | October 2014 | en_US |
dc.identifier.uri | http://hdl.handle.net/1993/23843 | |
dc.language.iso | eng | en_US |
dc.rights | open access | en_US |
dc.subject | Balanced incomplete block designs | en_US |
dc.subject | Self-orthogonal codes | en_US |
dc.title | The relationship between (16,6,3)-balanced incomplete block designs and (25,12) self-orthogonal codes | en_US |
dc.type | master thesis | en_US |
Files
License bundle
1 - 1 of 1
Loading...
- Name:
- license.txt
- Size:
- 2.25 KB
- Format:
- Item-specific license agreed to upon submission
- Description: