Balanced reconstruction codes for single edits
From MaRDI portal
Publication:6564093
Recommendations
Cites work
- scientific article; zbMATH DE number 43754 (Why is no real title available?)
- scientific article; zbMATH DE number 6900644 (Why is no real title available?)
- scientific article; zbMATH DE number 1867238 (Why is no real title available?)
- scientific article; zbMATH DE number 3240929 (Why is no real title available?)
- Asymptotic Improvement of the Gilbert–Varshamov Bound on the Size of Binary Codes
- Codes Correcting a Burst of Deletions or Insertions
- Coding Over Sets for DNA Storage
- Coding for Racetrack Memories
- Coding for Sequence Reconstruction for Single Edits
- Constant weight codes and group divisible designs
- Constructions for optimal constant weight cyclically permutable codes and difference families
- Constructions of binary constant-weight cyclic codes and cyclically permutable codes
- Correcting Deletions With Multiple Reads
- Correcting Two-Deletion With a Constant Number of Reads
- Correcting a Single Indel/Edit for DNA-Based Data Storage: Linear-Time Encoders and Order-Optimality
- DC-free coset codes
- Efficient Design of Subblock Energy-Constrained Codes and Sliding Window-Constrained Codes
- Efficient balanced codes
- Efficient reconstruction of sequences
- Efficient reconstruction of sequences from their subsequences of supersequences
- Error graphs and the reconstruction of elements in groups
- Exact Reconstruction From Insertions in Synchronization Codes
- Invitation to discrete mathematics
- Lower bounds for constant weight codes
- Mutually Uncorrelated Primers for DNA-Based Data Storage
- Nonasymptotic Upper Bounds for Deletion Correcting Codes
- On error-correcting balanced codes
- On reconstruction of signed permutations distorted by reversal errors
- On the undetected error probability of nonlinear binary constant weight codes
- On two-weight \(\mathbb {Z}_{2^k}\)-codes
- Reconstruction of a graph from 2-vicinities of its vertices
- Reconstruction of sequences distorted by two insertions
- Self-complementary balanced codes and quasi-symmetric designs
- Sequence Reconstruction for Limited-Magnitude Errors
- Two families of two-weight codes over \(\mathbb{Z}_4\)
- Two-dimensional weight-constrained codes through enumeration bounds
- Two-weight codes: upper bounds and new optimal constructions
- Upper bounds for constant-weight codes
This page was built for publication: Balanced reconstruction codes for single edits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6564093)
