List decoding of number field codes

被引：4

作者：

Coxon, Nicholas ^{[1
]}

机构：

[1] Univ Queensland, Sch Math & Phys, Brisbane, Qld 4072, Australia

来源：

DESIGNS CODES AND CRYPTOGRAPHY | 2014年 / 72卷 / 03期

关键词：

Number field codes; Chinese remainder codes; List decoding; FACTORING POLYNOMIALS; REED-SOLOMON; ALGORITHM; EQUATIONS;

D O I：

10.1007/s10623-013-9803-x

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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

页数：25

共 43 条

[11] Constructions of codes from number fields
Guruswami, V
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (03) : 594 - 603
[12] Improved decoding of Reed-Solomon and algebraic-geometry codes
Guruswami, V
Sudan, M
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (06) : 1757 - 1767
[13] Guruswami V, 2000, ANN IEEE SYMP FOUND, P159, DOI 10.1109/SFCS.2000.892076
[14] GURUSWAMI V, 2004, LECT NOTES COMPUTER, V3282
[15] Guruswami Venkatesan, 2001, Extensions to the Johnson bound
[16] Hanrot Guillaume, 2011, Coding and Cryptology. Proceedings of the Third International Workshop, IWCC 2011, P159, DOI 10.1007/978-3-642-20901-7_10
[17] COMPUTING EXACT DETERMINANT OF MATRICES WITH POLYNOMIAL ENTRIES
HOROWITZ, E
SAHNI, S
[J]. JOURNAL OF THE ACM, 1975, 22 (01) : 38 - 50
[18] Howgrave-Graham N, 1997, LECT NOTES COMPUT SC, V1355, P131, DOI 10.1007/BFb0024458
[19] IMPROVED ASYMPTOTIC BOUNDS FOR ERROR-CORRECTING CODES
JOHNSON, SM
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1963, 9 (03) : 198 - &
[20] A NEW UPPER BOUND FOR ERROR-CORRECTING CODES
JOHNSON, SM
[J]. IRE TRANSACTIONS ON INFORMATION THEORY, 1962, 8 (03): : 203 - 207

← 1 2 3 4 5 →