Decoding Reed-Muller codes by multi-layer perceptrons (original) (raw)
1993, International Journal of Electronics
Related papers
Factor Graph Approach for Decoding Reed Muller Codes
Factor graphs basically work on the idea of marginalization i.e. subdividing a larger function into a number of smaller functions whose contribution to the solution of the problem are considered accordingly. This paper uses Forney factor graph, which is a bipartite graph that models a system into function nodes and variable nodes. The messages are passed to and fro the two sets of nodes via specific message update rules chosen beforehand and the phenomena may be based on sum product or the max product algorithm. The algorithm converges to a decoded output after either a fixed number of iterations or is made to terminate after a threshold is achieved.
Weight Distribution and List-Decoding Size of Reed–Muller Codes
IEEE Transactions on Information Theory, 2000
The weight distribution and list-decoding size of Reed–Muller codes are studied in this work. Given a weight parameter, we are interested in bounding the number of Reed–Muller codewords with weight up to the given parameter; and given a received word and a distance parameter, we are interested in bounding the size of the list of Reed–Muller codewords that are within
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.