☆ 4.5 Article

t-Deletion-s-Insertion-Burst Correcting Codes

IEEE TRANSACTIONS ON INFORMATION THEORY (2023)

相关参考文献

注意：仅列出部分参考文献，下载原文获取全部文献信息。

Article Computer Science, Information Systems

Beyond Single-Deletion Correcting Codes: Substitutions and Transpositions

Ryan Gabrys et al.

Summary: This work investigates the problem of designing low-redundancy codes for correcting a combination of deletions, substitutions, and adjacent transpositions in DNA-based data storage. The authors make progress in three variations, constructing linear-time encodable and decodable codes with nearly optimal redundancy for single edit errors, single deletions or adjacent transpositions, and a combination of a deletion and a substitution. The results match or approach the existing theoretical bounds.

IEEE TRANSACTIONS ON INFORMATION THEORY (2023)

添加到收藏夹

Article Computer Science, Information Systems

Systematic Codes Correcting Multiple-Deletion and Multiple-Substitution Errors

Wentu Song et al.

Summary: This paper explores the construction of deletion and substitution correcting codes with low redundancy and efficient encoding/decoding. By simplifying existing methods and modifying syndrome compression techniques, a family of binary deletion and substitution correcting codes is proposed, with slight improvements for specific cases, as well as systematic deletion correcting codes being constructed.

IEEE TRANSACTIONS ON INFORMATION THEORY (2022)

添加到收藏夹

Article Computer Science, Information Systems

Explicit Two-Deletion Codes With Redundancy Matching the Existential Bound

Venkatesan Guruswami et al.

Summary: The study provides a constructive method for correcting errors in binary codes after deleting two bits, and explicitly determines the size of the codes. The existence of such codes was previously unclear.

IEEE TRANSACTIONS ON INFORMATION THEORY (2021)

添加到收藏夹

Article Computer Science, Information Systems

Correcting a Single Indel/Edit for DNA-Based Data Storage: Linear-Time Encoders and Order-Optimality

Kui Cai et al.

Summary: This article investigates codes that correct single indel or single edit, and provides linear-time algorithms to encode binary messages into these codes. Two order-optimal encoders over the quaternary alphabet are proposed, while a linear-time map is introduced over the DNA alphabet to achieve GC-balanced codewords that can correct single indel or single edit.

IEEE TRANSACTIONS ON INFORMATION THEORY (2021)

添加到收藏夹

Article Computer Science, Information Systems

On Optimal k-Deletion Correcting Codes

Jin Sima et al.

Summary: The study introduces a k-deletion correcting code with optimal redundancy for constant k, and presents encoding/decoding algorithms with low complexity.

IEEE TRANSACTIONS ON INFORMATION THEORY (2021)

添加到收藏夹

Proceedings Paper Computer Science, Theory & Methods

Optimal Codes Correcting Localized Deletions

Rawad Bitar et al.

Summary: Research on constructing codes that can correct localized deletions in unknown specific parts, proposing novel explicit codes that are efficiently encodable and decodable and can correct up to k localized deletions. These codes have log n + O(k log(2) (k log n)) redundancy, which is asymptotically optimal in n for k = o(log n/(log log n)(2)).

2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) (2021)

添加到收藏夹

Review Multidisciplinary Sciences

DNA storage: research landscape and future prospects

Yiming Dong et al.

NATIONAL SCIENCE REVIEW (2020)

添加到收藏夹

Proceedings Paper Computer Science, Theory & Methods

Optimal Systematic t-Deletion Correcting Codes

Jin Sima et al.

2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) (2020)

添加到收藏夹

Proceedings Paper Computer Science, Theory & Methods

Single-Deletion Single-Substitution Correcting Codes

Ilia Smagloy et al.

2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) (2020)

添加到收藏夹

Proceedings Paper Computer Science, Theory & Methods

Optimal Codes Correcting a Burst of Deletions of Variable Length

Andreas Lenz et al.

2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) (2020)

添加到收藏夹

Article Computer Science, Information Systems

Guess & Check Codes for Deletions, Insertions, and Synchronization

Serge Kas Hanna et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2019)

添加到收藏夹

Article Computer Science, Information Systems

Codes Correcting Two Deletions

Ryan Gabrys et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2019)

添加到收藏夹

Article Computer Science, Information Systems

Codes in the Damerau Distance for Deletion and Adjacent Transposition Correction

Ryan Gabrys et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2018)

添加到收藏夹

Article Computer Science, Information Systems

Efficient Low-Redundancy Codes for Correcting Multiple Deletions

Joshua Brakensiek et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2018)

添加到收藏夹

Article Computer Science, Information Systems

Codes Correcting a Burst of Deletions or Insertions

Clayton Schoeny et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2017)

添加到收藏夹

Article Engineering, Electrical & Electronic

Synchronizing Files From a Large Number of Insertions and Deletions

Frederic Sala et al.

IEEE TRANSACTIONS ON COMMUNICATIONS (2016)

添加到收藏夹

Article Computer Science, Information Systems

Using Reed-Muller RM (1, m) codes over channels with synchronization and substitution errors

Lara Dolecek et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2007)

添加到收藏夹

© Peeref 2019-2024. All rights reserved.