•  English
    • Persian
    • English
  •   Login
  • Ferdowsi University of Mashhad
  • |
  • Information Center and Central Library
    • Persian
    • English
  • Home
  • Source Types
    • Journal Paper
    • Ebook
    • Conference Paper
    • Standard
    • Protocol
    • Thesis
  • Use Help
View Item 
  •   FUM Digital Library
  • Fum
  • Articles
  • Latin Articles
  • View Item
  •   FUM Digital Library
  • Fum
  • Articles
  • Latin Articles
  • View Item
  • All Fields
  • Title
  • Author
  • Year
  • Publisher
  • Subject
  • Publication Title
  • ISSN
  • DOI
  • ISBN
Advanced Search
JavaScript is disabled for your browser. Some features of this site may not work without it.

An Improvement to Levenshtein's Upper Bound on the Cardinality of Deletion Correcting Codes

Author:
Cullina, Daniel
,
Kiyavash, Negar
Publisher:
IEEE
Year
: 2014
DOI: 10.1109/TIT.2014.2317698
URI: https://libsearch.um.ac.ir:443/fum/handle/fum/1130034
Keyword(s): combinatorial mathematics,error correction codes,Levenshtein',s bound,all-deletion case,all-insertion case,alphabet size,asymptotic upper bounds,code size,deletion correcting codes,packing argument,q-ary alphabet,Bipartite graph,Educational institutions,Electronic mail,Image edge detection,Laboratories,Materials,Upper bound,Codes,combinatorial mathematics
Collections :
  • Latin Articles
  • Show Full MetaData Hide Full MetaData
  • Statistics

    An Improvement to Levenshtein's Upper Bound on the Cardinality of Deletion Correcting Codes

Show full item record

contributor authorCullina, Daniel
contributor authorKiyavash, Negar
date accessioned2020-03-12T23:58:34Z
date available2020-03-12T23:58:34Z
date issued2014
identifier issn0018-9448
identifier other6799187.pdf
identifier urihttps://libsearch.um.ac.ir:443/fum/handle/fum/1130034
formatgeneral
languageEnglish
publisherIEEE
titleAn Improvement to Levenshtein's Upper Bound on the Cardinality of Deletion Correcting Codes
typeJournal Paper
contenttypeMetadata Only
identifier padid8310471
subject keywordscombinatorial mathematics
subject keywordserror correction codes
subject keywordsLevenshtein'
subject keywordss bound
subject keywordsall-deletion case
subject keywordsall-insertion case
subject keywordsalphabet size
subject keywordsasymptotic upper bounds
subject keywordscode size
subject keywordsdeletion correcting codes
subject keywordspacking argument
subject keywordsq-ary alphabet
subject keywordsBipartite graph
subject keywordsEducational institutions
subject keywordsElectronic mail
subject keywordsImage edge detection
subject keywordsLaboratories
subject keywordsMaterials
subject keywordsUpper bound
subject keywordsCodes
subject keywordscombinatorial mathematics
identifier doi10.1109/TIT.2014.2317698
journal titleInformation Theory, IEEE Transactions on
journal volume60
journal issue7
filesize639098
citations0
  • About Us
نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
DSpace software copyright © 2019-2022  DuraSpace