The k -subset sum problem over finite fields-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

The k -subset sum problem over finite fields

Published:2018-05 Issue: Volume:51 Page:204-217
ISSN:1071-5797
Container-title:Finite Fields and Their Applications
language:en
Short-container-title:Finite Fields and Their Applications

Author:

Wang Weiqiong,Nguyen Jennifer

Publisher

Elsevier BV

Subject

Applied Mathematics,General Engineering,Algebra and Number Theory,Theoretical Computer Science

Reference14 articles.

1. On deciding deep holes of Reed–Solomon codes;Cheng,2007

2. On the list and bounded distance decodability of Reed–Solomon codes;Cheng;SIAM J. Comput.,2007

3. Complexity of decoding positive-rate Reed–Solomon codes;Cheng;IEEE Trans. Inf. Theory,2010

4. On the subset sum problem over finite fields;Li;Finite Fields Appl.,2008

5. On the NP-hardness of bounded distance decoding of Reed–Solomon codes;Gandikota,2015

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Subset sums over Galois rings II;Journal of Number Theory;2023-11

2. Extensions of Schönemann's theorem in Galois rings;Discrete Mathematics;2023-01

3. Knapsack problems — An overview of recent advances. Part I: Single knapsack problems;Computers & Operations Research;2022-07

4. Moment subset sums over finite fields;Finite Fields and Their Applications;2020-02

5. Subset sums over Galois rings;Journal of Number Theory;2019-12

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP