On Naisargik Images of Varshamov-Tenengolts and Helberg Codes (2404.07670v1)
Abstract: The VT and Helberg codes, both in binary and non-binary forms, stand as elegant solutions for rectifying insertion and deletion errors. In this paper we consider the quaternary versions of these codes. It is well known that many optimal binary non-linear codes like Kerdock and Prepreta can be depicted as Gray images (isometry) of codes defined over $\mathbb{Z}_4$. Thus a natural question arises: Can we find similar maps between quaternary and binary spaces which gives interesting properties when applied to the VT and Helberg codes. We found several such maps called Naisargik (natural) maps and we study the images of quaternary VT and Helberg codes under these maps. Naisargik and inverse Naisargik images gives interesting error-correcting properties for VT and Helberg codes. If two Naisargik images of VT code generates an intersecting one deletion sphere, then the images holds the same weights. A quaternary Helberg code designed to correct $s$ deletions can effectively rectify $s+1$ deletion errors when considering its Naisargik image, and $s$-deletion correcting binary Helberg code can corrects $\lfloor\frac{s}{2}\rfloor$ errors with inverse Naisargik image.
- R. Varshamov and G. Tenengolts, “Codes which correct single asymet-ric errors,” Avtomatika i Telemekhanika, vol. 26, 01 1965.
- V. I. Levenshtein, “Binary codes capable of correcting deletions, insertions, and reversals,” Soviet physics. Doklady, vol. 10, pp. 707–710, 1965. [Online]. Available: https://api.semanticscholar.org/CorpusID:60827152
- G. Tenengolts, “Nonbinary codes, correcting single deletion or insertion (corresp.),” IEEE Transactions on Information Theory, vol. 30, no. 5, pp. 766–769, 1984.
- M. Abroshan, R. Venkataramanan, and A. G. I. Fabregas, “Efficient systematic encoding of non-binary vt codes,” in 2018 IEEE International Symposium on Information Theory (ISIT), 2018, pp. 91–95.
- Z. Yan, G. Qu, and H. Wu, “A novel soft-in soft-out decoding algorithm for vt codes on multiple received dna strands,” 06 2023, pp. 838–843.
- N. J. A. Sloane, “On single-deletion-correcting codes,” 2002.
- A. Helberg and H. Ferreira, “On multiple insertion/deletion correcting codes,” IEEE Transactions on Information Theory, vol. 48, no. 1, pp. 305–308, 2002.
- T. A. Le and H. D. Nguyen, “New multiple insertion/deletion correcting codes for non-binary alphabets,” IEEE Transactions on Information Theory, 2023.
- K. A. S. Abdel-Ghaffar, F. Paluncic, H. C. Ferreira, and W. A. Clarke, “On helberg’s generalization of the levenshtein code for multiple deletion/insertion error correction,” IEEE Transactions on Information Theory, vol. 58, no. 3, pp. 1804–1808, 2012.
- A. Hammons, P. Kumar, A. Calderbank, N. Sloane, and P. Sole, “The z/sub 4/-linearity of kerdock, preparata, goethals, and related codes,” IEEE Transactions on Information Theory, vol. 40, no. 2, pp. 301–319, 1994.
- J. Brakensiek, V. Guruswami, and S. Zbarsky, “Efficient low-redundancy codes for correcting multiple deletions,” IEEE Transactions on Information Theory, vol. 64, no. 5, pp. 3403–3410, 2018.
- Y. Erlich and D. Zielinski, “DNA fountain enables a robust and efficient storage architecture,” Science, vol. 355, no. 6328, pp. 950–954, 2017.
- L. Hu, H. Li, and Z. Ou, “Constructing optimal four-level designs via gray map code,” Metrika, 2018.
- F. Paluncic, K. Abdel-Ghaffar, H. Ferreira, and W. Clarke, “A multiple insertion/deletion correcting code for run-length limited sequences,” Information Theory, IEEE Transactions on, vol. 58, pp. 1809–1824, 03 2012.
- A. Helberg, “Coding for the correction of synchronization errors /.”
- K. Abdel-Ghaffar and H. Ferreira, “Systematic encoding of the varshamov-tenengol’ts codes and the constantin-rao codes,” Information Theory, IEEE Transactions on, vol. 44, pp. 340 – 345, 02 1998.
- L. Schulman and D. Zuckerman, “Asymptotically good codes correcting insertions, deletions, and transpositions,” Information Theory, IEEE Transactions on, vol. 45, pp. 2552 – 2557, 12 1999.
- T. T. Nguyen, K. Cai, and P. H. Siegel, “Every bit counts: A new version of non-binary vt codes with more efficient encoder,” 2022.
- B. Ginzburg, “A number-theoretic function with an application in the theory of coding,” Probl. Cybern., vol. 19, pp. 249–252, 01 1967.
- D. Shetranjiwala, K. Pandya, N. Savaliya, and M. K. Gupta, “Helberg code,” https://github.com/guptalab/GrayVT, 2024.
- M. K. Gupta, “On some linear codes over ℤ2ssubscriptℤsuperscript2𝑠\mathbb{Z}_{2^{s}}blackboard_Z start_POSTSUBSCRIPT 2 start_POSTSUPERSCRIPT italic_s end_POSTSUPERSCRIPT end_POSTSUBSCRIPT,” Ph.D. dissertation, Indian Institute of Technology, Kanpur, 1999.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
