Show simple item record

dc.contributor.authorLi, Zhiyuan
dc.date.accessioned2013-04-08T17:03:30Z
dc.date.available2013-04-08T17:03:30Z
dc.date.issued2013-04-08
dc.identifier.urihttp://hdl.handle.net/10464/4260
dc.description.abstractFinding large deletion correcting codes is an important issue in coding theory. Many researchers have studied this topic over the years. Varshamov and Tenegolts constructed the Varshamov-Tenengolts codes (VT codes) and Levenshtein showed the Varshamov-Tenengolts codes are perfect binary one-deletion correcting codes in 1992. Tenegolts constructed T codes to handle the non-binary cases. However the T codes are neither optimal nor perfect, which means some progress can be established. Latterly, Bours showed that perfect deletion-correcting codes have a close relationship with design theory. By this approach, Wang and Yin constructed perfect 5-deletion correcting codes of length 7 for large alphabet size. For our research, we focus on how to extend or combinatorially construct large codes with longer length, few deletions and small but non-binary alphabet especially ternary. After a brief study, we discovered some properties of T codes and produced some large codes by 3 different ways of extending some existing good codes.en_US
dc.subjectDesign theoryen_US
dc.subjectCoding theoryen_US
dc.titleConstruction of I-Deletion-Correcting Ternary Codesen_US
dc.degree.nameM.Sc. Computer Scienceen_US
dc.degree.levelMastersen_US
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.degree.disciplineFaculty of Mathematics and Scienceen_US
dc.embargo.termsNoneen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record