We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Neural decoders were shown to outperform classical message passing techniques for short BCH codes. In this work, we extend these results to much larger families of algebraic block codes, by performing message passing with graph neural networks. The parameters of the sub-network at each variable-node in the Tanner graph are obtained from a hypernetwork that receives the absolute values of the current message as input. To add stability, we employ a simplified version of the arctanh activation that is based on a high order Taylor approximation of this activation function. Our results show that for a large number of algebraic block codes, from diverse families of codes (BCH, LDPC, Polar), the decoding obtained with our method outperforms the vanilla belief propagation method as well as other learning techniques from the literature.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1909.09036")
get_code_for_paper("1909.09036")
have("1909.09036")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1909.09036.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1909.09036)
Connect an agent — have() is free.