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 条
  • [41] Reduced K-best sphere decoding algorithm based on minimum route distance and noise variance
    Xinyu Mao
    Jianjun Wu
    Haige Xiang
    Journal of Systems Engineering and Electronics, 2014, 25 (01) : 10 - 16
  • [42] SOFT-DECISION MINIMUM-DISTANCE SEQUENTIAL-DECODING ALGORITHM FOR CONVOLUTIONAL-CODES
    GOODMAN, RMF
    WINFIELD, AFT
    IEE PROCEEDINGS-F RADAR AND SIGNAL PROCESSING, 1981, 128 (03) : 179 - 186
  • [43] A new algorithm for the minimax location problem with the closest distance
    Nobakhtian, S.
    Dehkordi, A. Raeisi
    OPTIMIZATION, 2023, 72 (12) : 2893 - 2923
  • [44] A general variable neighborhood search approach for the minimum load coloring problem
    Alberto Herrán
    J. Manuel Colmenar
    Nenad Mladenović
    Abraham Duarte
    Optimization Letters, 2023, 17 : 2065 - 2086
  • [45] A general variable neighborhood search approach for the minimum load coloring problem
    Herran, Alberto
    Manuel Colmenar, J.
    Mladenovic, Nenad
    Duarte, Abraham
    OPTIMIZATION LETTERS, 2023, 17 (09) : 2065 - 2086
  • [46] A New Minimum Exposure Path Problem and Its Solving Algorithm
    Ye Miao
    Zhao MeiLing
    Cheng XiaoHui
    2015 11TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY (CIS), 2015, : 420 - 423
  • [47] A new robust approach to solve minimum vertex cover problem: Malatya vertex-cover algorithm
    Selman Yakut
    Furkan Öztemiz
    Ali Karci
    The Journal of Supercomputing, 2023, 79 : 19746 - 19769
  • [48] A new scaling algorithm for the minimum cost network flow problem
    Goldfarb, D
    Jin, ZY
    OPERATIONS RESEARCH LETTERS, 1999, 25 (05) : 205 - 211
  • [49] A new heuristic algorithm for the planar minimum covering circle problem
    Nasab, Hasan Hosseini
    Tavana, Mahdi
    Yousefi, Mohsen
    PRODUCTION AND MANUFACTURING RESEARCH-AN OPEN ACCESS JOURNAL, 2014, 2 (01): : 142 - 155
  • [50] A new robust approach to solve minimum vertex cover problem: Malatya vertex-cover algorithm
    Yakut, Selman
    Oeztemiz, Furkan
    Karci, Ali
    JOURNAL OF SUPERCOMPUTING, 2023, 79 (17): : 19746 - 19769
12345