Transformer-Based Decoding in Concatenated Coding Schemes Under Synchronization Errors
Julian Streit, Franziska Weindel, Reinhard Heckel

TL;DR
This paper introduces BCJRFormer, a transformer-based neural decoder for concatenated coding schemes with synchronization errors, offering scalable and efficient decoding for DNA data storage applications.
Contribution
The work presents BCJRFormer, a neural decoder that scales quadratically with noisy copies, and a novel ConvBCJRFormer architecture for convolutional code decoding, advancing decoding efficiency and capability.
Findings
BCJRFormer achieves error rates comparable to BCJR algorithm.
BCJRFormer scales quadratically with the number of noisy copies.
The combined transformer pipeline improves decoding efficiency for DNA data storage.
Abstract
We consider the reconstruction of a codeword from multiple noisy copies that are independently corrupted by insertions, deletions, and substitutions. This problem arises, for example, in DNA data storage. A common code construction uses a concatenated coding scheme that combines an outer linear block code with an inner code, which can be either a nonlinear marker code or a convolutional code. Outer decoding is done with Belief Propagation, and inner decoding is done with the Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm. However, the BCJR algorithm scales exponentially with the number of noisy copies, which makes it infeasible to reconstruct a codeword from more than about four copies. In this work, we introduce BCJRFormer, a transformer-based neural inner decoder. BCJRFormer achieves error rates comparable to the BCJR algorithm for binary and quaternary single-message transmissions of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDNA and Biological Computing · Error Correcting Code Techniques · Cellular Automata and Applications
