Reassembly Codes for the Chop-and-Shuffle Channel

by   Sajjad Nassirpour, et al.

We study the problem of retrieving data from a channel that breaks the input sequence into a set of unordered fragments of random lengths, which we refer to as the chop-and-shuffle channel. The length of each fragment follows a geometric distribution. We propose nested Varshamov-Tenengolts (VT) codes to recover the data. We evaluate the error rate and the complexity of our scheme numerically. Our results show that the decoding error decreases as the input length increases, and our method has a significantly lower complexity than the baseline brute-force approach. We also propose a new construction for VT codes, quantify the maximum number of the required parity bits, and show that our approach requires fewer parity bits compared to known results.


page 1

page 2

page 3

page 4


CRC selection for decoding of CRC-polar concatenated codes

An efficient scheme to increase the performance of polar codes at short ...

Communicating over the Torn-Paper Channel

We consider the problem of communicating over a channel that randomly "t...

Linear-Equation Ordered-Statistics Decoding

In this paper, we propose a new linear-equation ordered-statistics decod...

Free Ride on LDPC Coded Transmission

In this paper, we formulate a new problem to cope with the transmission ...

Unequal Error Protection Achieves Threshold Gains on BEC and BSC via Higher Fidelity Messages

Because of their capacity-approaching performance, graph-based codes hav...

Probabilistic Parity Shaping for Linear Codes

Linear layered probabilistic shaping (LLPS) is proposed, an architecture...

Fundamental Limits on Data Acquisition: Trade-offs between Sample Complexity and Query Difficulty

In this paper, we consider query-based data acquisition and the correspo...