perm2vec: Graph Permutation Selection for Decoding of Error Correction Codes using Self-Attention

• URL: http://arxiv.org/abs/2002.02315v2
• Date: Fri, 19 Feb 2021 08:27:51 GMT
• Title: perm2vec: Graph Permutation Selection for Decoding of Error Correction Codes using Self-Attention
• Authors: Nir Raviv, Avi Caciularu, Tomer Raviv, Jacob Goldberger and Yair Be'ery
• Abstract summary: We present a data-driven framework for permutation selection, combining domain knowledge with machine learning concepts. This work is the first to leverage the benefits of the neural Transformer networks in physical layer communication systems.
• Score: 19.879263834757758
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Error correction codes are an integral part of communication applications, boosting the reliability of transmission. The optimal decoding of transmitted codewords is the maximum likelihood rule, which is NP-hard due to the curse of dimensionality. For practical realizations, sub-optimal decoding algorithms are employed; yet limited theoretical insights prevent one from exploiting the full potential of these algorithms. One such insight is the choice of permutation in permutation decoding. We present a data-driven framework for permutation selection, combining domain knowledge with machine learning concepts such as node embedding and self-attention. Significant and consistent improvements in the bit error rate are introduced for all simulated codes, over the baseline decoders. To the best of the authors' knowledge, this work is the first to leverage the benefits of the neural Transformer networks in physical layer communication systems.

Related papers

• Equivariant Machine Learning Decoder for 3D Toric Codes [3.759936323189418]
  In quantum computing, errors can propagate fast and invalidate results, making the theoretical exponential speed increase in time, compared to traditional systems, obsolete. To correct errors in quantum systems, error-correcting codes are used. A subgroup of codes, topological codes, is currently the focus of many research papers.
  arXiv  Detail & Related papers  (2024-09-06T14:19:30Z)
• Breadth-first graph traversal union-find decoder [0.0]
  We develop variants of the union-find decoder that simplify its implementation and provide potential decoding speed advantages. We show how these methods can be adapted to decode non-topological quantum low-density-parity-check codes.
  arXiv  Detail & Related papers  (2024-07-22T18:54:45Z)
• 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)
• Testing the Accuracy of Surface Code Decoders [55.616364225463066]
  Large-scale, fault-tolerant quantum computations will be enabled by quantum error-correcting codes (QECC) This work presents the first systematic technique to test the accuracy and effectiveness of different QECC decoding schemes.
  arXiv  Detail & Related papers  (2023-11-21T10:22:08Z)
• Decoding algorithms for surface codes [0.0]
  Surface codes currently stand as the most promising candidates to build near term error corrected qubits. A critical aspect of decoding algorithms is their speed, since the quantum state will suffer additional errors with the passage of time. We describe the core principles of these decoding methods as well as existing variants that show promise for improved results.
  arXiv  Detail & Related papers  (2023-07-27T16:34:52Z)
• The END: An Equivariant Neural Decoder for Quantum Error Correction [73.4384623973809]
  We introduce a data efficient neural decoder that exploits the symmetries of the problem. We propose a novel equivariant architecture that achieves state of the art accuracy compared to previous neural decoders.
  arXiv  Detail & Related papers  (2023-04-14T19:46:39Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Neural Network Decoders for Permutation Codes Correcting Different Errors [20.70208671558469]
  Permutation codes were extensively studied in order to correct different types of errors for the applications on power line communication and rank modulation for flash memory. We introduce the neural network decoders for permutation codes to correct these errors with one-shot decoding.
  arXiv  Detail & Related papers  (2022-06-07T14:02:32Z)
• 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)

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.