Asymptotically good codes correcting insertions, deletions, and transpositions
暂无分享,去创建一个
[1] John M. Wozencraft,et al. Sequential decoding for reliable communication , 1957 .
[2] Barney. Reiffen,et al. Sequential encoding and decoding for the discrete memoryless channel , 1960 .
[3] R. Gallager. SEQUENTIAL DECODING FOR BINARY CHANNELS WITH NOISE AND SYNCHRONIZATION ERRORS , 1961 .
[4] Vladimir I. Levenshtein,et al. Binary codes capable of correcting deletions, insertions, and reversals , 1965 .
[5] Jeffrey D. Ullman,et al. On the capabilities of codes to correct synchronization errors , 1967, IEEE Trans. Inf. Theory.
[6] Lorenzo Calabi,et al. A family of codes for the correction of substitution and synchronization errors , 1969, IEEE Trans. Inf. Theory.
[7] Jørn Justesen,et al. Class of constructive asymptotically good algebraic codes , 1972, IEEE Trans. Inf. Theory.
[8] Tamotsu Kasai,et al. A Method for the Correction of Garbled Words Based on the Levenshtein Metric , 1976, IEEE Transactions on Computers.
[9] Eiichi Tanaka,et al. Synchronization and substitution error-correcting codes for the Levenshtein metric , 1976, IEEE Trans. Inf. Theory.
[10] J. Kruskal. An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules , 1983 .
[11] G. Tenengolts,et al. Nonbinary codes, correcting single deletion or insertion , 1984, IEEE Trans. Inf. Theory.
[12] V. Levenshtein. On perfect codes in deletion and insertion metric , 1992 .
[13] Madhu Sudan,et al. Highly Resilient Correctors for Polynomials , 1992, Inf. Process. Lett..
[14] Madhu Sudan,et al. Priority encoding transmission , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[15] Patrick A. H. Bours,et al. Construction of fixed-length insertion/deletion correcting runlength-limited codes , 1994, IEEE Trans. Inf. Theory.
[16] 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994 , 1994, FOCS.
[17] Paul H. Siegel,et al. Lee-metric BCH codes and their application to constrained and partial-response channels , 1994, IEEE Trans. Inf. Theory.
[18] Noga Alon,et al. Linear time erasure codes with nearly optimal recovery , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[19] Torleiv Kløve,et al. Codes correcting a single insertion/deletion of a zero or a single peak-shift , 1995, IEEE Trans. Inf. Theory.
[20] Daniel A. Spielman,et al. Linear-time encodable and decodable error-correcting codes , 1995, STOC '95.
[21] Elwyn R. Berlekamp,et al. Bounded distance+1 soft-decision Reed-Solomon decoding , 1996, IEEE Trans. Inf. Theory.
[22] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .