CAPABILITIES OF BOUNDED DISCREPANCY DECODING

被引：61
|
作者：
WYNER, AD
机构：
来源：
BELL SYSTEM TECHNICAL JOURNAL | 1965年 / 44卷 / 06期
关键词：
D O I：
10.1002/j.1538-7305.1965.tb04170.x
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
引用
收藏
页码：1061 / +
页数：1
相关论文
共 50 条
  • [1] BOUNDED DISCREPANCY SETS
    TIJDEMAN, R
    VOORHOEVE, M
    COMPOSITIO MATHEMATICA, 1981, 42 (03) : 375 - 389
  • [2] SEQUENCES WITH BOUNDED LOGARITHMIC DISCREPANCY
    BAKER, RC
    HARMAN, G
    MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1990, 107 : 213 - 225
  • [3] Depth-bounded discrepancy search
    Walsh, T
    IJCAI-97 - PROCEEDINGS OF THE FIFTEENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS 1 AND 2, 1997, : 1388 - 1393
  • [4] Decoding by Sampling: A Randomized Lattice Algorithm for Bounded Distance Decoding
    Liu, Shuiyin
    Ling, Cong
    Stehle, Damien
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (09) : 5933 - 5945
  • [5] DISCREPANCY AND APPROXIMATIONS FOR BOUNDED VC-DIMENSION
    MATOUSEK, J
    WELZL, E
    WERNISCH, L
    COMBINATORICA, 1993, 13 (04) : 455 - 466
  • [6] Bounded Verification with On-the-Fly Discrepancy Computation
    Fan, Chuchu
    Mitra, Sayan
    AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, ATVA 2015, 2015, 9364 : 446 - 463
  • [7] On Bounded Distance Decoding for general lattices
    Liu, Yi-Kai
    Lyubashevsky, Vadim
    Micciancio, Daniele
    APPROXIMATION, RANDOMIZATION AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2006, 4110 : 450 - 461
  • [8] Bounded distance decoding of the Leech lattice
    Xidian Univ, Xi'an, China
    Tien Tzu Hsueh Pao, 1 (62-66):
  • [9] Error Probabilities for Bounded Distance Decoding
    Andreas Faldum
    Julio Lafuente
    Gustavo Ochoa
    Wolfgang Willems
    Designs, Codes and Cryptography, 2006, 40 : 237 - 252
  • [10] Error probabilities for bounded distance decoding
    Faldum, Andreas
    Lafuente, Julio
    Ochoa, Gustavo
    Willems, Wolfgang
    DESIGNS CODES AND CRYPTOGRAPHY, 2006, 40 (02) : 237 - 252
12345