Unverified50% confidenceBenchmarkExact time
Experiments on multiple linear codes show that GBPNet achieves a lower bit error rate (BER) than traditional belief propagation and the evaluated state-of-the-art neural decoders.
1
Sources
50%
Confidence
Medium-term (~90 days)
Relevance
11/5/2026
First Seen
Valid until: 2/3/2027
Sources
Related Entities
Related Claims
UnverifiedThe paper's evaluation scope is limited to the selected linear codes and experimental conditions, and whether GBPNet fully avoids the computational overhead and generalization issues commonly faced by neural decoders still requires further verification.78% similarUnverifiedNeural-network-based quantum state discrimination has already demonstrated performance superior to traditional methods in signal classification, but its error is still limited by the Bayesian risk lower bound of the available readout distribution.70% similarUnverifiedBayesian Knowledge Tracing (BKT) is relatively insensitive to threshold changes, whereas neural network models become noticeably more selective as the threshold increases.66% similarUnverifiedIn the SISO uncoded setting, PARGAR with the channel scaling rule achieves a lower bit error rate (BER) than DeepRx in some sparse pilot scenarios while remaining competitive under dense pilots.66% similarUnverifiedGBP can rapidly smooth local errors between adjacent variables, but global errors spanning distant regions of the graph can only be corrected incrementally through long-distance message propagation, causing convergence speed to slow significantly on large-scale graphs.66% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1138432API
curl https://kongchang.com/api/v1/knowledge/claims/1138432MCP
get_claim(id=1138432)