An Improvement to Levenshtein's Upper Bound on the Cardinality of Deletion Correcting Codes
| contributor author | Cullina, Daniel | |
| contributor author | Kiyavash, Negar | |
| date accessioned | 2020-03-12T23:58:34Z | |
| date available | 2020-03-12T23:58:34Z | |
| date issued | 2014 | |
| identifier issn | 0018-9448 | |
| identifier other | 6799187.pdf | |
| identifier uri | http://libsearch.um.ac.ir:80/fum/handle/fum/1130034?show=full | |
| format | general | |
| language | English | |
| publisher | IEEE | |
| title | An Improvement to Levenshtein's Upper Bound on the Cardinality of Deletion Correcting Codes | |
| type | Journal Paper | |
| contenttype | Metadata Only | |
| identifier padid | 8310471 | |
| subject keywords | combinatorial mathematics | |
| subject keywords | error correction codes | |
| subject keywords | Levenshtein' | |
| subject keywords | s bound | |
| subject keywords | all-deletion case | |
| subject keywords | all-insertion case | |
| subject keywords | alphabet size | |
| subject keywords | asymptotic upper bounds | |
| subject keywords | code size | |
| subject keywords | deletion correcting codes | |
| subject keywords | packing argument | |
| subject keywords | q-ary alphabet | |
| subject keywords | Bipartite graph | |
| subject keywords | Educational institutions | |
| subject keywords | Electronic mail | |
| subject keywords | Image edge detection | |
| subject keywords | Laboratories | |
| subject keywords | Materials | |
| subject keywords | Upper bound | |
| subject keywords | Codes | |
| subject keywords | combinatorial mathematics | |
| identifier doi | 10.1109/TIT.2014.2317698 | |
| journal title | Information Theory, IEEE Transactions on | |
| journal volume | 60 | |
| journal issue | 7 | |
| filesize | 639098 | |
| citations | 0 |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
|
There are no files associated with this item. |
|||