A Gröbner representation for linear codes
暂无分享,去创建一个
Edgar Martínez-Moro | Mijail Borges-Quintana | Miguel A. Borges-Trenard | E. Martínez-Moro | M. Borges-Quintana | M. Borges-Trenard
[1] E. Martínez-Moro,et al. A General Framework for Applying FGLM Techniques to Linear Codes , 2005, AAECC.
[2] Teo Mora,et al. Solving Polynomial Equation Systems II: Macaulay's Paradigm and Gröbner Technology , 2005 .
[3] E. Martínez-Moro,et al. On a Gröbner bases structure associated to linear codes , 2005, math/0506045.
[4] Nicolas Sendrier,et al. Finding the permutation between equivalent linear codes: The support splitting algorithm , 2000, IEEE Trans. Inf. Theory.
[5] Yunghsiang Sam Han,et al. A New Decoding Algorithm for Complete Decoding of Linear Block Codes , 1998, SIAM J. Discret. Math..
[6] Erez Petrank,et al. Is code equivalence easy to decide? , 1997, IEEE Trans. Inf. Theory.
[7] Maria Grazia Marinari,et al. Gröbner bases of ideals defined by functionals with an application to ideals of projective points , 1993, Applicable Algebra in Engineering, Communication and Computing.
[8] Lev B. Levitin,et al. A new approach to the general minimum distance decoding problem: The zero-neighbors algorithm , 1985, IEEE Trans. Inf. Theory.
[9] Bruno Buchberger,et al. The Construction of Multivariate Polynomials with Preassigned Zeros , 1982, EUROCAM.
[10] Elwyn R. Berlekamp,et al. On the inherent intractability of certain coding problems (Corresp.) , 1978, IEEE Trans. Inf. Theory.
[11] Alexander Barg,et al. Complexity Issues in Coding Theory , 1997, Electron. Colloquium Comput. Complex..