List decoding of number field codes

被引：0
作者：
Nicholas Coxon
机构：
[1] The University of Queensland,School of Mathematics and Physics
来源：
Designs, Codes and Cryptography | 2014年 / 72卷
关键词：
Number field codes; Chinese remainder codes; List decoding; 11T71; 11H71; 11Y40;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
This paper presents a list decoding algorithm for the number field codes of Guruswami (IEEE Trans Inf Theory 49:594–603, 2003). The algorithm is an implementation of the unified framework for list decoding of algebraic codes of Guruswami, Sahai and Sudan (Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000), specialised for number field codes. The computational complexity of the algorithm is evaluated in terms of the size of the inputs and field invariants.
引用
收藏
页码：687 / 711
页数：24
相关论文
共 26 条
  • [21] Mignotte M.(1997)Decoding of Reed–Solomon codes beyond the error-correction bound J. Complex. 13 180-193
  • [22] Nguyen P.Q.(undefined)undefined undefined undefined undefined-undefined
  • [23] Stehlé D.(undefined)undefined undefined undefined undefined-undefined
  • [24] Pan V.(undefined)undefined undefined undefined undefined-undefined
  • [25] Richter H(undefined)undefined undefined undefined undefined-undefined
  • [26] Sudan M.(undefined)undefined undefined undefined undefined-undefined
123