Decoding algorithm as a moment problem related to the extended Lotka–Volterra system
文献类型：期刊论文
| 作者 | Pan,Yan1,2; Chang,Xiang-Ke1,2; Hu,Xing-Biao1,2 |
| 刊名 | Journal of Physics A: Mathematical and Theoretical
 |
| 出版日期 | 2020-01-08 |
| 卷号 | 53期号:5 |
| 关键词 | BCH-Goppa code extended Lotka–Volterra lattice moment problem |
| ISSN号 | 1751-8113 |
| DOI | 10.1088/1751-8121/ab5f89 |
| 英文摘要 | Abstract The moment problem related to the extended Lotka–Volterra system (sometimes also called the hungry Lotka–Volterra system or the Narita–Itoh–Bogoyavlensky lattice) over finite fields is introduced. It turns out the moment problem could be used to design an algorithm for decoding multiple BCH-Goppa codes over the same finite field simultaneously. When multiple codes have the same error locations, the algorithm requires fewer known syndromes and has lower computational complexity than running the decoding algorithm in Nakamura (1996 Phys. Lett. A 223 75–81) multiple times. |
| 语种 | 英语 |
| WOS记录号 | IOP:1751-8113-53-5-AB5F89 |
| 出版者 | IOP Publishing |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/50303]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 作者单位 | 1.LSEC, ICMSEC, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, PO Box 2719, Beijing 100190, People’s Republic of China 2.School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing 100049, People’s Republic of China |
| 推荐引用方式 GB/T 7714 | Pan,Yan,Chang,Xiang-Ke,Hu,Xing-Biao. Decoding algorithm as a moment problem related to the extended Lotka–Volterra system[J]. Journal of Physics A: Mathematical and Theoretical,2020,53(5). |
| APA | Pan,Yan,Chang,Xiang-Ke,&Hu,Xing-Biao.(2020).Decoding algorithm as a moment problem related to the extended Lotka–Volterra system.Journal of Physics A: Mathematical and Theoretical,53(5). |
| MLA | Pan,Yan,et al."Decoding algorithm as a moment problem related to the extended Lotka–Volterra system".Journal of Physics A: Mathematical and Theoretical 53.5(2020). |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。