9 research outputs found
Efficient Systematic Encoding of Non-binary VT Codes
Varshamov-Tenengolts (VT) codes are a class of codes which can correct a
single deletion or insertion with a linear-time decoder. This paper addresses
the problem of efficient encoding of non-binary VT codes, defined over an
alphabet of size . We propose a simple linear-time encoding method to
systematically map binary message sequences onto VT codewords. The method
provides a new lower bound on the size of -ary VT codes of length .Comment: This paper will appear in the proceedings of ISIT 201
Use of non-binary vt-codes in network traffic watermarking
According to the current level of telecommunications development, 5G communication systems are expected to provide higher data rates, lower latency and improved scalability
SPIDER-WEB enables stable, repairable, and encryptible algorithms under arbitrary local biochemical constraints in DNA-based storage
DNA has been considered as a promising medium for storing digital
information. Despite the biochemical progress in DNA synthesis and sequencing,
novel coding algorithms need to be constructed under the specific constraints
in DNA-based storage. Many functional operations and storage carriers were
introduced in recent years, bringing in various biochemical constraints
including but not confined to long single-nucleotide repeats and abnormal GC
content. Existing coding algorithms are not applicable or unstable due to more
local biochemical constraints and their combinations. In this paper, we design
a graph-based architecture, named SPIDER-WEB, to generate corresponding
graph-based algorithms under arbitrary local biochemical constraints. These
generated coding algorithms could be used to encode arbitrary digital data as
DNA sequences directly or served as a benchmark for the follow-up construction
of coding algorithms. To further consider recovery and security issues existing
in the storage field, it also provides pluggable algorithmic patches based on
the generated coding algorithms: path-based correcting and mapping shuffling.
They provide approaches for probabilistic error correction and symmetric
encryption respectively.Comment: 30 pages; 12 figures; 2 table
Coding for Segmented Edit Channels.
We consider insertion and deletion channels with the additional assumption that the channel input sequence is implicitly divided into segments such that at most one edit can occur within a segment. No segment markers are available in the received sequence. We propose code constructions for the segmented deletion, segmented insertion, and segmented insertion-deletion channels based on subsets of Varshamov-Tenengolts codes chosen with pre-determined prefixes and/or suffixes. The proposed codes, constructed for any finite alphabet, are zero-error and can be decoded segment-by-segment. We also derive an upper bound on the rate of any zero-error code for the segmented edit channel, in terms of the segment length. This upper bound shows that the rate scaling of the proposed codes as the segment length increases is the same as that of the maximal code
Efficient Systematic Encoding of Non-binary VT Codes
This paper addresses the problem of efficient encoding of non-binary Varshamov-Tenengolts (VT) codes. We propose a linear-time encoding method to systematically map binary message sequences onto VT codewords. The method provides a new lower bound on the size of q-ary VT codes of length n