From Channel Codes to Computation Codes

被引:0
|
作者
Simon, Francois [1 ]
机构
[1] Telecom SudParis, CITI, Inst TELECOM, F-91011 Evry, France
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this paper, it is shown that a computation code exists for a stationary and (d) over bar -continuous noisy computation if a channel code exists for the "virtual" channel linking the expected result of the perfect computation and the actual result given by the noisy computation. This proves the possibility to built an efficient computation code from an efficient channel code.
引用
收藏
页码:337 / 341
页数:5
相关论文
共 50 条
  • [1] Construction of wiretap codes from ordinary channel codes
    Hayashi, Masahito
    Matsumoto, Ryutaroh
    2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 2538 - 2542
  • [2] Local Computation in Codes
    Kaufman, Tali
    2010 IEEE INFORMATION THEORY WORKSHOP (ITW), 2010,
  • [3] Multiple Access Channel Resolvability Codes From Source Resolvability Codes
    Sultana, Rumia
    Chou, Remi A.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (06) : 3608 - 3619
  • [4] Cooperative Relay Channel with LDPC Codes Constructed from Array Codes
    Somphruek, Mingkwan
    Carrasco, Rolando
    Le Goff, Stephane
    WTS: 2009 WIRELESS TELECOMMUNICATIONS SYMPOSIUM, 2009, : 161 - 166
  • [5] Quantum computation from dynamic automorphism codes
    Davydova, Margarita
    Tantivasadakarn, Nathanan
    Balasubramanian, Shankar
    Aasen, David
    QUANTUM, 2024, 8 : 1 - 101
  • [6] On the Duality between Multiple-Access Codes and Computation Codes
    Zhu, Jingge
    Lim, Sung Hoon
    Gastpar, Michael
    2017 INFORMATION THEORY AND APPLICATIONS WORKSHOP (ITA), 2017,
  • [7] ALPHABET CODES AND FIELDS OF COMPUTATION
    SOLOMON, G
    INFORMATION AND CONTROL, 1974, 25 (04): : 395 - 398
  • [8] AN EFFICIENT ALGORITHM FOR COMPUTATION OF SHAPE MOMENTS FROM RUN-LENGTH CODES OR CHAIN CODES
    DAI, M
    BAYLOU, P
    NAJIM, M
    PATTERN RECOGNITION, 1992, 25 (10) : 1119 - 1128
  • [9] Inference and computation with population codes
    Pouget, A
    Dayan, P
    Zemel, RS
    ANNUAL REVIEW OF NEUROSCIENCE, 2003, 26 : 381 - 410
  • [10] Secure computation from random error correcting codes
    Chen, Hao
    Cramer, Ronald
    Goldwasser, Shafi
    de Haan, Robbert
    Vaikuntanathan, Vinod
    Advances in Cryptology - EUROCRYPT 2007, 2007, 4515 : 291 - 310