NEW APPROACH TO THE GENERAL MINIMUM DISTANCE DECODING PROBLEM: THE ZERO-NEIGHBORS ALGORITHM.

被引：0
|
作者：
Levitin, Lev B. [1 ]
Hartmann, Carlos R.P. [1 ]
机构：
[1] Syracuse Univ, Sch of Computer &, Information Science, Syracuse, NY,, USA, Syracuse Univ, Sch of Computer & Information Science, Syracuse, NY, USA
来源：
| 1600年 / IT-31期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
CODES, SYMBOLIC
引用
收藏
相关论文
共 50 条
  • [21] A new approach to the information set decoding algorithm
    deBarros, DJ
    Godoy, W
    Wille, ECG
    COMPUTER COMMUNICATIONS, 1997, 20 (04) : 302 - 308
  • [22] A New Algorithm for Solving the Rank Syndrome Decoding Problem
    Aragon, Nicolas
    Gaborit, Philippe
    Hauteville, Adrien
    Tillich, Jean-Pierre
    2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2018, : 2421 - 2425
  • [23] A NEW PROCEDURE FOR DECODING CYCLIC AND BCH CODES UP TO ACTUAL MINIMUM DISTANCE
    FENG, GL
    TZENG, KK
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (05) : 1364 - 1374
  • [24] A New Approach to the Restart Genetic Algorithm to Solve Zero-One Knapsack Problem
    Montazeri, Mojtaba
    Kiani, Rasoul
    Rastkhadiv, Seyed Saleh
    2017 IEEE 4TH INTERNATIONAL CONFERENCE ON KNOWLEDGE-BASED ENGINEERING AND INNOVATION (KBEI), 2017, : 50 - 53
  • [25] A New Approach for Constructing and Decoding Maximum Rank Distance Codes
    Mandavifar, Hessam
    2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017,
  • [26] A modified blahut algorithm for decoding reed-solomon codes beyond half the minimum distance
    Egorov, S
    Markarian, G
    SYMPOTIC'03: JOINT IST WORKSHOP ON MOBILE FUTURE & SYMPOSIUM ON TRENDS IN COMMUNICATIONS, PROCEEDINGS, 2003, : 17 - 20
  • [27] An iterative probabilistic decoding algorithm for binary linear block codes beyond the half minimum distance
    Mihaljevic, MJ
    APPLIED ALGEBRA, ALGEBRAIC ALGORITHMS AND ERROR-CORRECTING CODES, 1997, 1255 : 237 - 249
  • [28] A modified Blahut algorithm for decoding Reed-Solomon codes beyond half the minimum distance
    Egorov, S
    Markarian, G
    Pickavance, K
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2004, 52 (12) : 2052 - 2056
  • [29] Decoding of repeated-root cyclic codes up to new bounds on their minimum distance
    A. Zeh
    M. Ulmschneider
    Problems of Information Transmission, 2015, 51 : 217 - 230
  • [30] Decoding of Quasi-Cyclic Codes up to A New Lower Bound on the Minimum Distance
    Zeh, Alexander
    Ling, San
    2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2014, : 2584 - 2588
12345