Improvements of Winograd's result on computation in the presence of noise (Corresp.)
From MaRDI portal
Publication:3222106
DOI10.1109/TIT.1984.1056974zbMATH Open0556.94003OpenAlexW2030352236MaRDI QIDQ3222106
Publication date: 1984
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1984.1056974
multiuser information theorycodes with lattice propertiescomputation in the presence of noisemin-preserving codes
Information theory (general) (94A15) Coding theorems (Shannon theory) (94A24) Theory of computing (68Q99)
Related Items (1)
Recommendations
- Unnamed Item π π
- Unnamed Item π π
- Worst case complexity of problems with random information noise π π
- On Reliable Computation by Noisy Random Boolean Formulas π π
- On the maximum tolerable noise of k-input gates for reliable computation by formulas π π
- Noisy Information and Computational Complexity π π
- Computing with Noisy Information π π
- On the maximum tolerable noise for reliable computation by formulas π π
- Theory of Cryptography π π
- On the maximum tolerable noise for reliable computation by formulas π π
This page was built for publication: Improvements of Winograd's result on computation in the presence of noise (Corresp.)