Local Decoding in Distributed Approximate Computing

Consider a distributed coding for computing problem with constant decoding locality, i.e., with a vanishing error probability, any single sample of the function can be approximately recovered by probing only constant number of compressed bits. We establish an achievable rate region by designing an e...

Full description

Bibliographic Details

Published in:	Proceedings / IEEE International Symposium on Information Theory pp. 2766 - 2771
Main Authors:	Yuan, Deheng, Guo, Tao, Huang, Zhongyi, Jin, Shi
Format:	Conference Proceeding
Language:	English
Published:	IEEE 07.07.2024
Subjects:	Approximate computing Codes Coding for computing Decoding distributed computing Encoding Error probability graph characterization Graph theory local decoding Random variables
ISSN:	2157-8117
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!