Nearly optimal multiuser codes for the binary adder channel

被引：0
|
作者：
Johns Hopkins Univ, Baltimore, United States [1 ]
机构：
来源：
IEEE Trans Inf Theory | / 2卷 / 387-398期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Communication channels (information theory)
引用
收藏
相关论文
共 50 条
  • [21] A Nearly Optimal Construction of Flash Codes
    Mahdavifar, Hessam
    Siegel, Paul H.
    Vardy, Alexander
    Wolf, Jack K.
    Yaakobi, Eitan
    2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4, 2009, : 1239 - 1243
  • [22] Equidistant Codes Meeting the Plotkin Bound are Not Optimal on the Binary Symmetric Channel
    Chen, Po-Ning
    Lin, Hsuan-Yin
    Moser, Stefan M.
    2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 3015 - 3019
  • [23] Iterative decoding of turbo convolutional codes over noisy two-user binary adder channel
    Alcoforado, M. L. M. G.
    da Rocha, V. C., Jr.
    Markarian, G.
    Lima, M. J. C.
    ELECTRONICS LETTERS, 2011, 47 (13) : 749 - U36
  • [24] New uniquely decodable codes for the T-user binary adder channel with 3 ≤ T ≤ 5
    Kiviluoto, Lasse
    Ostergard, Patric R. J.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (03) : 1219 - 1220
  • [25] Signature codes for noisy multiple access adder channel
    Vladimir Gritsenko
    Grigory Kabatiansky
    Vladimir Lebedev
    Alexey Maevskiy
    Designs, Codes and Cryptography, 2017, 82 : 293 - 299
  • [26] Signature codes for noisy multiple access adder channel
    Gritsenko, Vladimir
    Kabatiansky, Grigory
    Lebedev, Vladimir
    Maevskiy, Alexey
    DESIGNS CODES AND CRYPTOGRAPHY, 2017, 82 (1-2) : 293 - 299
  • [27] CODES FOR AN ADDER CHANNEL WITH MULTIPLE CORRELATED SOURCES.
    Dyn'kin, V.N.
    Kurdyukov, A.P.
    Problems of information transmission, 1980, 16 (04) : 260 - 265
  • [28] CODES FOR T-USER NOISELESS ADDER CHANNEL
    KHACHATRIAN, GK
    MARTIROSSIAN, SS
    PROBLEMS OF CONTROL AND INFORMATION THEORY-PROBLEMY UPRAVLENIYA I TEORII INFORMATSII, 1987, 16 (03): : 187 - 192
  • [29] Signature Codes for a Noisy Adder Multiple Access Channel
    Erdogan, Gokberk
    Maringer, Georg
    Polyanskii, Nikita
    2022 IEEE INFORMATION THEORY WORKSHOP (ITW), 2022, : 476 - 481
  • [30] Nearly Optimal Constructions of PIR and Batch Codes
    Asi, Hilal
    Yaakobi, Eitan
    2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017, : 151 - 155
12345