Show simple item record

dc.creatorYoung, Andrew 1989-
dc.date.accessioned2013-06-04T16:12:52Z
dc.date.available2013-06-04T16:12:52Z
dc.date.created2012-05
dc.date.issued2012-04-22
dc.date.submittedMay 2012
dc.identifier.urihttp://hdl.handle.net/1969.1/148838
dc.description.abstractThis work provides a detailed analysis of the general Sudoku problem with particular attention given to the first nontrivial case. A formal mathematical model is developed and used to determine several important parameters; including error upper bound, equivalence class decomposition, and entropy optimal path. The implicit communication problem is established and exhaustive simulation provides an explicit expression for the probability of error. Using an ordered transmission sequence or path the model is extended to rateless communication.en
dc.format.mimetypeapplication/pdf
dc.subjectCodingen
dc.subjectError Correctionen
dc.subjectCommunicationen
dc.subjectSudokuen
dc.titleOn the Application of Sudoku to Error Correction in Communication
dc.typeThesisen
thesis.degree.departmentCollege of Engineeringen
thesis.degree.disciplineElectrical Engineeringen
thesis.degree.grantorHonors and Undergraduate Researchen
thesis.degree.nameBachelor of Scienceen
dc.contributor.committeeMemberCostas Georghiades
dc.type.materialtexten
dc.date.updated2013-06-04T16:12:52Z


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record