Improved p-ary Codes and Sequence Families from Galois Rings of Characteristic p2
暂无分享,去创建一个
[1] Marcus Greferath,et al. Gray isometries for finite chain rings and a nonlinear ternary (36, 312, 15) code , 1999, IEEE Trans. Inf. Theory.
[2] Patrick Solé,et al. Nonlinear p-ary Sequences , 2003, Applicable Algebra in Engineering, Communication and Computing.
[3] San Ling,et al. Zpk+1-Linear codes , 2002, IEEE Trans. Inf. Theory.
[4] Sascha Barg. On small families of sequences with low periodic correlation , 1993, Algebraic Coding.
[5] A. Robert Calderbank,et al. An upper bound for Weft exponential sums over Galois tings and applications , 1994, IEEE Trans. Inf. Theory.
[6] Mohammad Umar Siddiqi,et al. Optimal biphase sequences with large linear complexity derived from sequences over Z4 , 1996, IEEE Trans. Inf. Theory.
[7] Tor Helleseth,et al. Improved estimates via exponential sums for the minimum distance of Z4-linear trace codes , 1996, IEEE Trans. Inf. Theory.
[8] A. Nechaev,et al. Kerdock code in a cyclic form , 1989 .
[9] Rudolf Lide,et al. Finite fields , 1983 .
[10] Tor Helleseth,et al. Improved binary codes and sequence families from Z4-linear codes , 1996, IEEE Trans. Inf. Theory.
[11] Claude Carlet. Z2k-Linear Codes , 1998, IEEE Trans. Inf. Theory.
[12] CarletC.. Z2k-linear codes , 1998 .
[13] K. Conrad,et al. Finite Fields , 2018, Series and Products in the Development of Mathematics.
[14] San Ling,et al. An improvement on the bounds of Weil exponential sums over Galois rings with some applications , 2004, IEEE Transactions on Information Theory.