Learning Binary Autoencoder-Based Codes with Progressive Training

• URL: http://arxiv.org/abs/2511.09221v1
• Date: Thu, 13 Nov 2025 01:41:30 GMT
• Title: Learning Binary Autoencoder-Based Codes with Progressive Training
• Authors: Vukan Ninkovic, Dejan Vukobratovic,
• Abstract summary: 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.
• Score: 1.8620637029128544
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: Error correcting codes play a central role in digital communication, ensuring that transmitted information can be accurately reconstructed despite channel impairments. Recently, autoencoder (AE) based approaches have gained attention for the end-to-end design of communication systems, offering a data driven alternative to conventional coding schemes. However, enforcing binary codewords within differentiable AE architectures remains difficult, as discretization breaks gradient flow and often leads to unstable convergence. To overcome this limitation, a simplified two stage training procedure is proposed, consisting of a continuous pretraining phase followed by direct binarization and fine tuning without gradient approximation techniques. For the (7,4) block configuration over a binary symmetric channel (BSC), the learned encoder-decoder pair learns a rotated version (coset code) of the optimal Hamming code, naturally recovering its linear and distance properties and thereby achieving the same block error rate (BLER) with maximum likelihood (ML) decoding. These results indicate that compact AE architectures can effectively learn structured, algebraically optimal binary codes through stable and straightforward training.

Related papers

• Consistency Flow Model Achieves One-step Denoising Error Correction Codes [28.89866643527586]
  We introduce the Error Correction Consistency Flow Model (ECCFM) for high-fidelity one-step decoding.<n>ECCFM attains lower bit-error rates (BER) than autoregressive and diffusion-based baselines.<n>It delivers inference speeds up from 30x to 100x faster than denoising diffusion decoders.
  arXiv  Detail & Related papers  (2025-12-01T08:07:51Z)
• Decoding for Punctured Convolutional and Turbo Codes: A Deep Learning Solution for Protocols Compliance [32.887114329215045]
  This paper proposes a unified long short-term memory (LSTM)-based neural decoder for punctured convolutional and Turbo codes.<n>The key component of the proposed LSTM-based neural decoder is puncturing-aware embedding, which integrates puncturing patterns directly into the neural network.
  arXiv  Detail & Related papers  (2025-02-21T14:00:14Z)
• 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)
• 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)
• Denoising Diffusion Error Correction Codes [92.10654749898927]
  Recently, neural decoders have demonstrated their advantage over classical decoding techniques. Recent state-of-the-art neural decoders suffer from high complexity and lack the important iterative scheme characteristic of many legacy decoders. We propose to employ denoising diffusion models for the soft decoding of linear codes at arbitrary block lengths.
  arXiv  Detail & Related papers  (2022-09-16T11:00:50Z)
• 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)
• Boost decoding performance of finite geometry LDPC codes with deep learning tactics [3.1519370595822274]
  We seek a low-complexity and high-performance decoder for a class of finite geometry LDPC codes. It is elaborated on how to generate high-quality training data effectively.
  arXiv  Detail & Related papers  (2022-05-01T14:41:16Z)
• Error Correction Code Transformer [92.10654749898927]
  We propose to extend for the first time the Transformer architecture to the soft decoding of linear codes at arbitrary block lengths. We encode each channel's output dimension to high dimension for better representation of the bits information to be processed separately. The proposed approach demonstrates the extreme power and flexibility of Transformers and outperforms existing state-of-the-art neural decoders by large margins at a fraction of their time complexity.
  arXiv  Detail & Related papers  (2022-03-27T15:25:58Z)
• Adversarial Neural Networks for Error Correcting Codes [76.70040964453638]
  We introduce a general framework to boost the performance and applicability of machine learning (ML) models. We propose to combine ML decoders with a competing discriminator network that tries to distinguish between codewords and noisy words. Our framework is game-theoretic, motivated by generative adversarial networks (GANs)
  arXiv  Detail & Related papers  (2021-12-21T19:14:44Z)
• Infomax Neural Joint Source-Channel Coding via Adversarial Bit Flip [41.28049430114734]
  We propose a novel regularization method called Infomax Adversarial-Bit-Flip (IABF) to improve the stability and robustness of the neural joint source-channel coding scheme. Our IABF can achieve state-of-the-art performances on both compression and error correction benchmarks and outperform the baselines by a significant margin.
  arXiv  Detail & Related papers  (2020-04-03T10:00:02Z)

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.