Zobrazeno 1 - 10
of 28
pro vyhledávání: '"RACHEL YUN"'
Autor:
Gupta, Meghal, Zhang, Rachel Yun
In an error-correcting code, a sender encodes a message $x \in \{ 0, 1 \}^k$ such that it is still decodable by a receiver on the other end of a noisy channel. In the setting of \emph{error-correcting codes with feedback}, after sending each bit, the
Externí odkaz:
http://arxiv.org/abs/2410.01951
Autor:
Gupta, Meghal, Zhang, Rachel Yun
In interactive coding, Alice and Bob wish to compute some function $f$ of their individual private inputs $x$ and $y$. They do this by engaging in an interactive protocol to jointly compute $f(x,y)$. The goal is to do this in an error-resilient way,
Externí odkaz:
http://arxiv.org/abs/2309.04586
We describe a new parameterized family of symmetric error-correcting codes with low-density parity-check matrices (LDPC). Our codes can be described in two seemingly different ways. First, in relation to Reed-Muller codes: our codes are functions on
Externí odkaz:
http://arxiv.org/abs/2308.15563
Autor:
Gupta, Meghal, Zhang, Rachel Yun
In a streaming algorithm, Bob receives an input $x \in \{0,1\}^n$ via a stream and must compute a function $f$ in low space. However, this function may be fragile to errors in the input stream. In this work, we investigate what happens when the input
Externí odkaz:
http://arxiv.org/abs/2307.07087
Autor:
Gupta, Meghal, Zhang, Rachel Yun
In an interactive error-correcting code (iECC), Alice and Bob engage in an interactive protocol with the goal of Alice communicating a message $x \in \{ 0, 1 \}^k$ to Bob in such a way that even if some fraction of the total communicated bits are cor
Externí odkaz:
http://arxiv.org/abs/2305.04376
In the setting of error-correcting codes with feedback, Alice wishes to communicate a $k$-bit message $x$ to Bob by sending a sequence of bits over a channel while noiselessly receiving feedback from Bob. It has been long known (Berlekamp, 1964) that
Externí odkaz:
http://arxiv.org/abs/2212.05673
Autor:
Gupta, Meghal, Zhang, Rachel Yun
Given a noiseless protocol $\pi_0$ computing a function $f(x, y)$ of Alice and Bob's private inputs $x, y$, the goal of interactive coding is to construct an error-resilient protocol $\pi$ computing $f$ such that even if some fraction of the communic
Externí odkaz:
http://arxiv.org/abs/2207.01144
Autor:
Gupta, Meghal, Zhang, Rachel Yun
In interactive coding, Alice and Bob wish to compute some function $f$ of their individual private inputs $x$ and $y$. They do this by engaging in a non-adaptive (fixed order, fixed length) protocol to jointly compute $f(x,y)$. The goal is to do this
Externí odkaz:
http://arxiv.org/abs/2110.15395
Publikováno v:
Turkish Journal of Electrical Engineering and Computer Sciences. 31:448-461
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d2b2dd1a32b400b4d024ae68e3e50941
https://doi.org/10.55730/1300-0632.3994
https://doi.org/10.55730/1300-0632.3994
Publikováno v:
Proceedings of the 55th Annual ACM Symposium on Theory of Computing.
In the setting of error-correcting codes with feedback, Alice wishes to communicate a $k$-bit message $x$ to Bob by sending a sequence of bits over a channel while noiselessly receiving feedback from Bob. It has been long known (Berlekamp, 1964) that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::696410e9856891663cf9d57012178afa
https://doi.org/10.1145/3564246.3585126
https://doi.org/10.1145/3564246.3585126