UPPER ERROR BOUND OF A NEW NEAR-OPTIMAL CODE

被引：0
|
作者：
BUDA, RD
机构：
[1] MCMASTER UNIV, HAMILTON, ONTARIO, CANADA
[2] CANADIAN GEN ELECT CO LTD, TORONTO, ONTARIO, CANADA
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 1975年 / 21卷 / 04期
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：441 / 445
页数：5
相关论文
共 50 条
  • [1] NEAR-OPTIMAL SINGLE-SYNCHRONIZATION-ERROR-COR ECTING CODE
    ULLMAN, JD
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1966, 12 (04) : 418 - +
  • [2] Self-accelerated Thompson sampling with near-optimal regret upper bound
    Zhu, Zhenyu
    Huang, Liusheng
    Xu, Hongli
    NEUROCOMPUTING, 2020, 399 : 37 - 47
  • [3] Triangular code:Near-optimal linear time fountain code
    Jalaluddin Qureshi
    Chuan Heng Foh
    Digital Communications and Networks, 2023, 9 (04) : 869 - 878
  • [4] Near-Optimal Upper Bound on Fourier Dimension of Boolean Functions in Terms of Fourier Sparsity
    Sanyal, Swagato
    Automata, Languages, and Programming, Pt I, 2015, 9134 : 1035 - 1045
  • [5] Triangular code: Near-optimal linear time fountain code
    Qureshi, Jalaluddin
    Foh, Chuan Heng
    DIGITAL COMMUNICATIONS AND NETWORKS, 2023, 9 (04) : 869 - 878
  • [6] Near-Optimal Performance of Quantum Error Correction Codes
    Zheng, Guo
    He, Wenhao
    Lee, Gideon
    Jiang, Liang
    PHYSICAL REVIEW LETTERS, 2024, 132 (25)
  • [7] On the Upper Bound on Undetected Error Probability for LDPC code
    Rybin, Pavel
    Zyablov, Victor
    2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2014, : 3160 - 3164
  • [8] On the Design of Near-Optimal Sparse Code Multiple Access Codebooks
    Chen, Yen-Ming
    Chen, Jian-Wei
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2020, 68 (05) : 2950 - 2962
  • [9] TWO CLASSES OF NEAR-OPTIMAL CODEBOOKS WITH RESPECT TO THE WELCH BOUND
    Luo, Gaojun
    Cao, Xiwang
    ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2021, 15 (02) : 279 - 289
  • [10] Near-Optimal Turbo Decoding in Presence of SNR Estimation Error
    El-Khamy, Mostafa
    Wu, Jinhong
    Lee, Jungwon
    Roh, Heejin
    Kang, Inyup
    2012 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2012, : 3737 - 3742
12345