DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim H.K. | ko |
dc.contributor.author | Lee J.Y. | ko |
dc.contributor.author | Oh D.Y. | ko |
dc.date.accessioned | 2013-03-08T16:52:02Z | - |
dc.date.available | 2013-03-08T16:52:02Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2010 | - |
dc.identifier.citation | IEEE TRANSACTIONS ON INFORMATION THEORY, v.56, no.7, pp.3217 - 3220 | - |
dc.identifier.issn | 0018-9448 | - |
dc.identifier.uri | http://hdl.handle.net/10203/93639 | - |
dc.description.abstract | We improve Levenshtein's upper bound for the cardinality of a code of length four that is capable of correcting single deletions over an alphabet of even size. We also illustrate that the new upper bound is sharp. Furthermore we construct an optimal perfect code that is capable of correcting single deletions for the same parameters. | - |
dc.language | English | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.title | Optimal Single Deletion Correcting Code of Length Four Over an Alphabet of Even Size | - |
dc.type | Article | - |
dc.identifier.wosid | 000278812000015 | - |
dc.identifier.scopusid | 2-s2.0-77953780904 | - |
dc.type.rims | ART | - |
dc.citation.volume | 56 | - |
dc.citation.issue | 7 | - |
dc.citation.beginningpage | 3217 | - |
dc.citation.endingpage | 3220 | - |
dc.citation.publicationname | IEEE TRANSACTIONS ON INFORMATION THEORY | - |
dc.identifier.doi | 10.1109/TIT.2010.2048492 | - |
dc.contributor.localauthor | Lee J.Y. | - |
dc.contributor.nonIdAuthor | Kim H.K. | - |
dc.contributor.nonIdAuthor | Oh D.Y. | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | Deletion and insertion distance | - |
dc.subject.keywordAuthor | group divisible system | - |
dc.subject.keywordAuthor | Levenshtein&apos | - |
dc.subject.keywordAuthor | s bound | - |
dc.subject.keywordAuthor | perfect code | - |
dc.subject.keywordAuthor | Steiner quadruple system | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.