Codes for channels with segmented edits
暂无分享,去创建一个
[1] David J. C. MacKay,et al. Reliable communication over channels with insertions, deletions, and substitutions , 2001, IEEE Trans. Inf. Theory.
[2] Khaled A. S. Abdel-Ghaffar,et al. On Helberg's Generalization of the Levenshtein Code for Multiple Deletion/Insertion Error Correction , 2012, IEEE Transactions on Information Theory.
[3] Vladimir I. Levenshtein,et al. Binary codes capable of correcting deletions, insertions, and reversals , 1965 .
[4] Hendrik C. Ferreira,et al. On multiple insertion/Deletion correcting codes , 2002, IEEE Trans. Inf. Theory.
[5] V. Guruswami,et al. Efficient low-redundancy codes for correcting multiple deletions , 2016, SODA 2016.
[6] Ankur A. Kulkarni,et al. Nonasymptotic Upper Bounds for Deletion Correcting Codes , 2012, IEEE Transactions on Information Theory.
[7] Michael Mitzenmacher,et al. Codes for deletion and insertion channels with segmented errors , 2010, IEEE Trans. Inf. Theory.
[8] Edward A. Ratzer. Marker codes for channels with insertions and deletions , 2005, Ann. des Télécommunications.
[9] N.J.A. Sloane,et al. On Single-Deletion-Correcting Codes , 2002, math/0207197.