Codes in the Damerau Distance for Deletion and Adjacent Transposition Correction
From MaRDI portal
Publication:4569203
DOI10.1109/TIT.2017.2778143zbMath1390.94941OpenAlexW2769372735MaRDI QIDQ4569203
Olgica Milenković, Eitan Yaakobi, Ryan Gabrys
Publication date: 27 June 2018
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2017.2778143
Related Items (4)
The Modular Subset-Sum Problem and the size of deletion correcting codes ⋮ Deletion correcting codes meet the Littlewood-Offord problem ⋮ Construction of single-deletion-correcting DNA codes using CIS codes ⋮ Decoding algorithms of monotone codes and azinv codes and their unified view
This page was built for publication: Codes in the Damerau Distance for Deletion and Adjacent Transposition Correction
