Construction of single-deletion-correcting DNA codes using CIS codes
From MaRDI portal
Publication:2211338
DOI10.1007/s10623-020-00802-2zbMath1478.94118OpenAlexW3087975960MaRDI QIDQ2211338
Whan-Hyuk Choi, Hyun Jin Kim, Yoon-Jin Lee
Publication date: 11 November 2020
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-020-00802-2
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Synchronization error-correcting codes (94B50)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complementary information set codes over \(\mathrm{GF}(p)\)
- On the Varshamov-Tenengolts construction on binary strings
- Linear and nonlinear constructions of DNA codes with Hamming distance \(d\), constant GC-content and a reverse-complement constraint
- Bounds for DNA codes with constant GC-content
- Linear constructions for DNA codes
- Construction of reversible self-dual codes
- A New Class of Codes for Boolean Masking of Cryptographic Computations
- Codes in the Damerau Distance for Deletion and Adjacent Transposition Correction
- Correcting Deletions Using Linear and Cyclic Codes
- Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms
This page was built for publication: Construction of single-deletion-correcting DNA codes using CIS codes