A Class of Optimal Structures for Node Computations in Message Passing Algorithms

DOI10.1109/TIT.2021.3119952zbMath1489.94100arXiv2009.02535OpenAlexW3206214271MaRDI QIDQ5030271

Xuan He, Kui Cai, Liang Zhou

Publication date: 17 February 2022

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2009.02535

zbMATH Keywords

message passing algorithmsminimum complexityminimum latency

Mathematics Subject Classification ID

Cryptography (94A60) Source coding (94A29)

This page was built for publication: A Class of Optimal Structures for Node Computations in Message Passing Algorithms