论文信息 - On cyclic codes that are invariant under the general linear group

On cyclic codes that are invariant under the general linear group

Using a polynomial approach to linear codes, one derives necessary and sufficient conditions for cyclic q -ary codes to be invariant under the general linear group of substitutions over an extension field of GF(q) . The important class of polynomial codes, introduced by Kasami, Lin, and Peterson, satisfy the conditions and several new results are obtained about some of these codes.

Philippe Delsarte | P. Delsarte

[1] Shu Lin,et al. Polynomial codes , 1968, IEEE Trans. Inf. Theory.

[2] E. J. Weldon,et al. New generalizations of the Reed-Muller codes-II: Nonprimitive codes , 1968, IEEE Trans. Inf. Theory.

[3] G. Solomon,et al. A New Treatment of Bose-Chaudhuri Codes , 1961 .

[4] Jean-Marie Goethals,et al. On Generalized Reed-Muller Codes and Their Relatives , 1970, Inf. Control..

[5] Jean-Marie Goethals,et al. On a class of majority-logic decodable cyclic codes , 1968, IEEE Trans. Inf. Theory.

[6] Luther D. Rudolph,et al. A class of majority logic decodable codes (Corresp.) , 1967, IEEE Trans. Inf. Theory.

[7] Tadao Kasami,et al. New generalizations of the Reed-Muller codes-I: Primitive codes , 1968, IEEE Trans. Inf. Theory.

[8] Philippe Delsarte,et al. A geometric approach to a class of cyclic codes , 1969 .

[9] Shu Lin,et al. Some Results on Cyclic Codes which Are Invariant under the Affine Group and Their Application , 1966, Inf. Control..

[10] J. Rotman. An Introduction to the Theory of Groups , 1965 .