[1]SAKATA S. Finding a minimal set of linear recurring relations capable of generating a given finite twodimensional array [J]. Journal of Symbolic Computation, 1988, 5(3): 321-337.
[2]SAKATA S. Extension of the BerlekampMassey algorithm to N dimensions [J]. Information and Computation, 1990, 84(2): 207-239.
[3]FENG G L, RAO T R N. Decoding algebraicgeometric codes up to the designed minimum distance [J]. IEEE Transactions on Information Theory, 1993, 39(1): 37-45.
[4]BRASAMORóS M, O’SULLIVAN M E. The correction capability of the BerlekampMasseySakata algorithm with majority voting [J]. Applicable Algebra in Engineering, Communication and Computing, 2006, 17(5): 315-335.
[5]SAINTS K, HEEGARD C. Algebraicgeometric codes and multidimensional cyclic codes: a unified theory and algorithms for decoding using Grbner bases [J]. IEEE Transactions on Information Theory, 2002, 41(6): 1733-1751.
[6]BUCHBERGER B. Grbner bases: an algorithmic method in polynomial ideal theory [C] // Multidimensional Systems Theory. Berlin: Springer, 1985: 184-232.
[7]王东明, 牟晨琪, 李晓亮, 等. 多项式代数 [M]. 北京: 高等教育出版社, 2011.
[8]FAUGERE JC. A new efficient algorithm for computing Grbner bases (F4) [J]. Journal of Pure and Applied Algebra, 1999, 139(1-3): 61-88.
[9]FAUGERE JC. A new efficient algorithm for computing Grbner bases without reduction to zero (F5) [C] // Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation. New York: ACM, 2002: 75-83.
[10]FAUGERE JC, SAFEY EL DIN M, SPAENLEHAUER PJ.Computing loci of rank defects of linear matrices using Grbner bases and applications to cryptology [C] // Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation. New York: ACM, 2010: 257-264.
[11]LEE K M,O’SULLIVAN M E. List decoding of ReedSolomon codes from a Grbner basis perspective [J]. Journal of Symbolic Computation, 2008, 43(9): 645-658.
[12]LIN Z, XU L, BOSE N K. A tutorial on Grbner bases with applications in signals and systems [J]. IEEE Transactions on Circuits and Systems I: Regular Papers, 2008, 15(1): 445-461.
[13]LAUBENBACHER R, STURMFELS B. Computer algebra in systems biology [J]. The American Mathematical Monthly, 2009, 116(10): 882-891.
[14]COX D, LITTLE J, O’SHEA D. Using algebraic geometry[M].2nd ed. Berlin: Springer, 2005.
[15]FAUGERE JC, MOU CHENQI. Fast algorithm for change of ordering of zerodimensional Grbner bases with sparse multiplication matrices [C] // Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation. New York: ACM, 2011: 115-122.
[16]FAUGERE JC, GIANNI P, LAZARD D, et al. Efficient computation of zerodimensional Grbner bases by change of ordering [J]. Journal of Symbolic Computation, 1993, 16(4): 329-344.
[17]BJORCK G, FROBERG R. A faster way to count the solutions of inhomogeneous systems of algebraic equations, with applications to cyclic nroots [J]. Journal of Symbolic Computation, 1991, 12(3): 329-336.
[18]BASIRI A, FAUGERE JC. Changing the ordering of Grbner bases with LLL: case of two variables [C] // SENDRA J. R.Proceedings of the 2003 International Symposium on Symbolic and Algebraic Computation. New York: ACM, 2003: 23-29. |