MaskCode: Mask Transformer for Feedback-Assisted Coding With Linear Block Codes

• URL: http://arxiv.org/abs/2609.00715v1
• Date: Tue, 01 Sep 2026 04:47:42 GMT
• Title: MaskCode: Mask Transformer for Feedback-Assisted Coding With Linear Block Codes
• Abstract summary: MaskCode is a Transformer-based inner feedback code for ECCd coding systems.<n>It explicitly incorporates structural knowledge of the outer linear block code into the inner feedback encoder design.<n>It consistently outperforms all baselines, achieving up to 1.5 dB SNR gain.
• Score: 27.89688326131855
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Feedback-based coding schemes have demonstrated substantial performance gains over today's open-loop coding schemes. Unfortunately, these gains are usually achieved in idealized settings with perfect feedback. Over the last few years, machine learning-based schemes have been shown to be promising solutions for implementing feedback-based codes, particularly when combined with short-block-length open-loop error correcting codes (ECCs) in a concatenated coding structure. However, existing ML-based feedback schemes remain agnostic to the outer code's structure, potentially misallocating feedback resources on error patterns already correctable by the outer ECC. To address this, we propose MaskCode, a Transformer-based inner feedback code for concatenated coding systems, which explicitly incorporates structural knowledge of the outer linear block code into the inner feedback encoder design via two synergistic mechanisms: 1) a soft syndrome-based input that informs the encoder about potential parity constraint violations, and 2) a code-aware attention mask derived from the Tanner graph. We further show that end-to-end training with a differentiable belief propagation (BP) decoder offers no additional gain, as MaskCode's structure-aware design already internalizes the structural knowledge of the outer code; in fact, backpropagation through the iterative BP decoder introduces gradient explosion, which degrades rather than improves performance. Extensive evaluations on BCH and LDPC outer codes demonstrate that MaskCode consistently outperforms all baselines, achieving up to 1.5 dB SNR gain.

Related papers

• Learning Binary Autoencoder-Based Codes with Progressive Training [1.8620637029128544]
  Autoencoder (AE) based approaches have gained attention for the end-to-end design of communication systems.<n>These results indicate that compact AE architectures can effectively learn structured, algebraically optimal binary codes through stable and straightforward training.
  arXiv  Detail & Related papers  (2025-11-12T11:32:03Z)
• Threshold Selection for Iterative Decoding of $(v,w)$-regular Binary Codes [84.0257274213152]
  Iterative bit flipping decoders are an efficient choice for sparse $(v,w)$-regular codes.<n>We propose concrete criteria for threshold determination, backed by a closed form model.
  arXiv  Detail & Related papers  (2025-01-23T17:38:22Z)
• GNN-based Auto-Encoder for Short Linear Block Codes: A DRL Approach [43.17241175857862]
  It integrates deep reinforcement learning (DRL) and graph neural networks (GNN) in code design.<n>An edge-weighted GNN (EW-GNN) decoder is proposed, which operates on the Tanner graph with an iterative message-passing structure.<n>An iterative joint training of the DRL-based code designer and the EW-GNN decoder is performed to optimize the end-end encoding and decoding process.
  arXiv  Detail & Related papers  (2024-12-03T00:25:14Z)
• Factor Graph Optimization of Error-Correcting Codes for Belief Propagation Decoding [62.25533750469467]
  Low-Density Parity-Check (LDPC) codes possess several advantages over other families of codes. The proposed approach is shown to outperform the decoding performance of existing popular codes by orders of magnitude.
  arXiv  Detail & Related papers  (2024-06-09T12:08:56Z)
• Learning Linear Block Error Correction Codes [62.25533750469467]
  We propose for the first time a unified encoder-decoder training of binary linear block codes. We also propose a novel Transformer model in which the self-attention masking is performed in a differentiable fashion for the efficient backpropagation of the code gradient.
  arXiv  Detail & Related papers  (2024-05-07T06:47:12Z)
• Component Training of Turbo Autoencoders [8.692972779213932]
  Isolated training with Gaussian priors (TGP) of the component autoencoders of turbo-autoencoder enables faster, more consistent training. We propose fitting the components via extrinsic information transfer (EXIT) charts to a desired behavior which enables scaling to larger message lengths.
  arXiv  Detail & Related papers  (2023-05-16T06:48:40Z)
• Robust Non-Linear Feedback Coding via Power-Constrained Deep Learning [7.941112438865385]
  We develop a new family of non-linear feedback codes that greatly enhance robustness to channel noise. Our autoencoder-based architecture is designed to learn codes based on consecutive blocks of bits. We show that our scheme outperforms state-of-the-art feedback codes by wide margins over practical forward and feedback noise regimes.
  arXiv  Detail & Related papers  (2023-04-25T22:21:26Z)
• Neural Belief Propagation Decoding of Quantum LDPC Codes Using Overcomplete Check Matrices [60.02503434201552]
  We propose to decode QLDPC codes based on a check matrix with redundant rows, generated from linear combinations of the rows in the original check matrix. This approach yields a significant improvement in decoding performance with the additional advantage of very low decoding latency.
  arXiv  Detail & Related papers  (2022-12-20T13:41:27Z)
• Graph Neural Networks for Channel Decoding [71.15576353630667]
  We showcase competitive decoding performance for various coding schemes, such as low-density parity-check (LDPC) and BCH codes. The idea is to let a neural network (NN) learn a generalized message passing algorithm over a given graph. We benchmark our proposed decoder against state-of-the-art in conventional channel decoding as well as against recent deep learning-based results.
  arXiv  Detail & Related papers  (2022-07-29T15:29:18Z)
• Pruning Neural Belief Propagation Decoders [77.237958592189]
  We introduce a method to tailor an overcomplete parity-check matrix to (neural) BP decoding using machine learning. We achieve performance within 0.27 dB and 1.5 dB of the ML performance while reducing the complexity of the decoder.
  arXiv  Detail & Related papers  (2020-01-21T12:05:46Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.