☆ 4.3 Article

Insdel codes from subspace and rank-metric codes

DISCRETE MATHEMATICS (2024)

相关参考文献

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

Article Computer Science, Information Systems

Reed Solomon Codes Against Adversarial Insertions and Deletions

Roni Con et al.

Summary: In this work, the performance of Reed-Solomon codes against adversarial insertion-deletion errors is studied. It is proven that there are Reed-Solomon codes that can decode from a certain number of insdel errors over fields of different sizes. A deterministic construction is given for larger fields, and for a specific case, an efficient construction is provided. Additionally, a lower bound on the field size for such constructions is proved.

IEEE TRANSACTIONS ON INFORMATION THEORY (2023)

添加到收藏夹

Article Computer Science, Information Systems

Improved Singleton Bound on Insertion-Deletion Codes and Optimal Constructions

Bocong Chen et al.

Summary: This research further explores the properties and bounds of insertion-deletion codes through the construction of optimized Reed-Solomon codes, and proposes new conditions that meet these bounds.

IEEE TRANSACTIONS ON INFORMATION THEORY (2022)

添加到收藏夹

Article Engineering, Electrical & Electronic

10 Years of Natural Data Storage

Dixita Limbachiya et al.

Summary: The demand for robust and reliable data storage medium is fueled by the explosion of digital data. Natural storage mediums like DNA, bacteria, and protein have shown potential as the next generation information storage systems, and are being explored by researchers.

IEEE TRANSACTIONS ON MOLECULAR BIOLOGICAL AND MULTI-SCALE COMMUNICATIONS (2022)

添加到收藏夹

Article Computer Science, Theory & Methods

NEW CONSTRUCTIONS OF LARGE CYCLIC SUBSPACE CODES VIA SIDON SPACES

Minyao Niu et al.

Summary: This paper introduces a construction method for cyclic subspace codes and presents an improved and generalized construction for cyclic subspace codes. Under certain conditions, by considering different Sidon spaces and the orbit of F(q)k, a cyclic subspace code with a larger number of codewords is obtained.

ADVANCES IN MATHEMATICS OF COMMUNICATIONS (2022)

添加到收藏夹

Article Computer Science, Hardware & Architecture

Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound

Bernhard Haeupler et al.

Summary: The introduction of synchronization strings provides a novel way to transform synchronization errors into Hamming-type errors efficiently. By indexing sequences with synchronization strings, efficient insdel codes can be designed to correct insertion or deletion errors effectively.

JOURNAL OF THE ACM (2021)

添加到收藏夹

Article Computer Science, Information Systems

Explicit Constructions of Two-Dimensional Reed-Solomon Codes in High Insertion and Deletion Noise Regime

Tai Do Duc et al.

Summary: This article explores the synchronization issues in communication systems caused by insertion and deletion errors, and provides explicit constructions for two families of 2-dimensional Reed-Solomon codes with insdel error-correcting capabilities asymptotically reaching those provided by the Singleton bound. The research improves on previous constructions and highlights the potential of Reed-Solomon codes in correcting insdel errors in communication systems.

IEEE TRANSACTIONS ON INFORMATION THEORY (2021)

添加到收藏夹

Article Computer Science, Information Systems

Synchronization Strings and Codes for Insertions and Deletions-A Survey

Bernhard Haeupler et al.

Summary: The paper surveys recent progress in designing efficient error-correcting codes over finite alphabets that correct insertions and deletions. Most state-of-the-art codes rely on synchronization strings, which are simple yet powerful pseudo-random objects.

IEEE TRANSACTIONS ON INFORMATION THEORY (2021)

添加到收藏夹

Article Computer Science, Information Systems

Efficiently List-Decodable Insertion and Deletion Codes via Concatenation

Shu Liu et al.

Summary: This paper examines the list decoding property of codes under insertion and deletion errors (insdel). It analyzes the list decodability of random insdel codes and constructs a family of insdel codes with efficient encoding and decoding algorithms through concatenation method, providing a Zyablov-type bound for insdel metric codes.

IEEE TRANSACTIONS ON INFORMATION THEORY (2021)

添加到收藏夹

Article Computer Science, Information Systems

Codes Correcting Two Deletions

Ryan Gabrys et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2019)

添加到收藏夹

Article Computer Science, Information Systems

Construction of Sidon Spaces With Applications to Coding

Ron M. Roth et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2018)

添加到收藏夹

Article Telecommunications

Family of Constrained Codes for Archival DNA Data Storage

Dixita Limbachiya et al.

IEEE COMMUNICATIONS LETTERS (2018)

添加到收藏夹

Article Computer Science, Theory & Methods

EFFICIENT DECODING OF INTERLEAVED SUBSPACE AND GABIDULIN CODES BEYOND THEIR UNIQUE DECODING RADIUS USING GROBNER BASES

Hannes Bartz et al.

ADVANCES IN MATHEMATICS OF COMMUNICATIONS (2018)

添加到收藏夹

Article Computer Science, Information Systems

Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms

Siddharth Jain et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2017)

添加到收藏夹

Article Computer Science, Information Systems

Correcting Deletions Using Linear and Cyclic Codes

Khaled A. S. Abdel-Ghaffar et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2010)

添加到收藏夹

Article Computer Science, Information Systems

A rank-metric approach to error control in random network coding

Danilo Silva et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2008)

添加到收藏夹

Article Computer Science, Information Systems

Coding for errors and erasures in random network coding

Ralf Koetter et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2008)

添加到收藏夹

Article Computer Science, Information Systems

Classification of the deletion correcting capabilities of Reed-Solomon codes of dimension 2 over prime fields

Luke McAven et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2007)

添加到收藏夹

Review Computer Science, Artificial Intelligence

Survey of clustering algorithms

R Xu et al.

IEEE TRANSACTIONS ON NEURAL NETWORKS (2005)

添加到收藏夹

© Peeref 2019-2024. All rights reserved.