Skip to main navigation Skip to search Skip to main content

Lattice based codes for insertion and deletion channels

  • CNRS LTCI
  • Department of Mathematics
  • King Abdulaziz University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Citation (Scopus)

Abstract

Insertion/Deletion codes for the Levenshtein distance are constructed by truncation of lattices for the L1 metric. These lattices are obtained from Construction A applied to binary codes and Z4-codes. Finally, Gilbert and Hamming type of bounds are derived.

Original languageEnglish
Title of host publication2013 IEEE International Symposium on Information Theory, ISIT 2013
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages684-688
Number of pages5
ISBN (Print)9781479904464
DOIs
Publication statusPublished - 1 Jan 2013
Externally publishedYes
Event2013 IEEE International Symposium on Information Theory, ISIT 2013 - Istanbul, Turkey
Duration: 7 Jul 2013 → 12 Jul 2013

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095
ISSN (Electronic)2157-8117

Conference

Conference2013 IEEE International Symposium on Information Theory, ISIT 2013
Country/TerritoryTurkey
CityIstanbul
Period7/07/13 → 12/07/13

Keywords

  • Construction A
  • Insertion/ Deletion codes
  • Lee metric
  • lattice
  • weight enumerator
  • ν-series

Fingerprint

Dive into the research topics of 'Lattice based codes for insertion and deletion channels'. Together they form a unique fingerprint.

Cite this