您当前的位置:
首页 >
文章列表页 >
Computing Free Distances of Convolutional Codes by Simulated Annealing
更新时间:2025-12-08
    • Computing Free Distances of Convolutional Codes by Simulated Annealing

    • Acta Electronica Sinica   Issue 7, (1995)
    • CLC: O236
    • Published:1995

    移动端阅览

  • 马缚龙, 张木想, 王育民. Computing Free Distances of Convolutional Codes by Simulated Annealing[J]. Acta Electronica Sinica, 1995, (7). DOI:

  •  
  •  
icon
试读结束,您可以激活您的VIP账号继续阅读。
去激活 >
icon
试读结束,您可以通过登录账户,到个人中心,购买VIP会员阅读全文。
已是VIP会员?
去登录 >

0

Views

86

下载量

6

CSCD

Alert me when the article has been cited
提交
Tools
Download
Export Citation
Share
Add to favorites
Add to my album

Related Articles

A Fast Algorithm for Computing the Free Distance of Convolutional Codes
A Salp Swarm Algorithm Based on Stepped Tent Chaos and Simulated Annealing
Build Kd-Tree for Virtual Scenes in a Fast and Optimal Way
Hybrid Artificial Fish Swarm Optimization Algorithm Based on Mutation Operator and Simulated Annealing
Compounding Reconstruction for Synthetic Aperture Radar Images

Related Author

WANG Xin mei
CHEN Jun
DONG Chao-yi
CHEN Xiao-yan
QI Yong-sheng
ZHAO Xiao-yi
WANG Qi-lai
ZHOU Peng

Related Institution

National Key Lab.on ISN,Xidian University,Xi′an
Inner Mongolia Electromechanical Control Laboratory
Inner Mongolia University of Technology
State Key Laboratory for Novel Software Technology, Nanjing University
Zhengzhou Institute of Light IndustryZhengzhouHenan 450002China
0