Loading...

An algorithmic approach for finding deletion correcting codes

Khajouei, F ; Sharif University of Technology

628 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/ITW.2011.6089432
  3. Abstract:
  4. A general construction for deletion/insertion correcting codes is proposed by concatenating codes derived from a heuristic maximal independent set algorithm on an appropriately defined graph. Our heuristic algorithm is polynomial with respect to the number of nodes in the graph. This methodology may be used for construction of any length n, s-deletion code. Our experimental results show that cardinalities of our codebooks exceed sizes of all previously known constructions. In fact, they are comparable to Levenshteins lower bound
  5. Keywords:
  6. Algorithmic approach ; Cardinalities ; Codebooks ; Correcting codes ; Deletion-correcting ; Lower bounds ; Maximal independent set algorithms ; Heuristic algorithms ; Codes (symbols)
  7. Source: 2011 IEEE Information Theory Workshop, ITW 2011 ; 2011 , Pages 25-29 ; 9781457704376 (ISBN)
  8. URL: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6089432