Message Passing Decoding for self-dual F4-additive codes

Authors

  • Constanza Susana Riera Bergen University College
  • Pål Ellingsen Bergen University College
  • Matthew Parker University of Bergen
  • Hannah Amanda Hansen Bergen University College

Abstract

In this paper, we look at self-dual additive codes over the finite field GF(4). Such codes have a natural graph representation that arises from the code’s generator matrix. Working with the graph representations of such codes we investigate a method for doing message-passing decoding.

References

Eli Ben-Sasson, Iddo Ben-Tov, Ivan Damg°ard, Yuval Ishai, and Noga Ron-Zewi. On public key encryption from noisy codewords. In IACR International Workshop on Public Key Cryptography, pages 417–446. Springer, 2016.

A Robert Calderbank, Eric M. Rains, Peter W. Shor, and Neil JA Sloane.
Quantum error correction via codes over gf (4). arXiv preprint quant-ph/9608006, 1996.

Lars Eirik Danielsen and Matthew G. Parker. On the classification of all
self-dual additive codes over gf (4) of length up to 12. Journal of Combinatorial Theory, Series A, 113(7):1351–1367, 2006.

Robert G. Gallager. Low density parity check codes. IRE Trans. Information
Theory, 8:21–28, 1962.

Hannah A Hansen. Message-passing decoding on self-dual F4-additive codes.
Master’s thesis, Høgskolen i Bergen, 2016.
http://home.hib.no/ansatte/pel/message-passing-decoding-f4.pdf.

R. M. Tanner. A recursive approach to low complexity codes. IEEE
Transactions on Information Theory, 27:533–547, 1981.

Published

2016-11-30

Issue

Section

Norsk Informasjonssikkerhetskonferanse 2016