论文信息 - Permutation decoding of Abelian codes - 字舞流文

Permutation decoding of Abelian codes

A permutation decoding procedure for abelian codes is introduced by using the Groebner bases theory. This method is valid for decoding all the binary abelian codes. Some examples are given to show how powerful this method can be. >

Hervé Chabanne | H. Chabanne

[1] Shojiro Sakata. Decoding binary 2-D cyclic codes by the 2-D Berlekamp-Massey algorithm , 1991, IEEE Trans. Inf. Theory.

[2] Shojiro Sakata,et al. On determining the independent point set for doubly periodic arrays and encoding two-dimensional cyclic codes and their duals , 1981, IEEE Trans. Inf. Theory.

[3] Hideki Imai,et al. A Theory of Two-Dimensional Cyclic Codes , 1977, Inf. Control..

[4] P. Delsarte. AUTOMORPHISMS OF ABELIAN CODES , 1970 .

[5] Shojiro Sakata. General theory of doubly periodic arrays over an arbitrary finite field and its applications , 1978, IEEE Trans. Inf. Theory.

[6] J. Macwilliams. Permutation decoding of systematic codes , 1964 .

[7] Jørn M. Jensen,et al. The concatenated structure of cyclic and Abelian codes , 1985, IEEE Trans. Inf. Theory.