Titlebook: EUROCODE ‘90; International Sympos Gérard Cohen,Pascale Charpin Conference proceedings 1991 Springer-Verlag Berlin Heidelberg 1991 Algebrai

情爱

Auflösung linearer GleichungssystemeFollowing R. Pellikaan who gave, in 1989, an algorithm which decodes geometric codes up to . errors where d* is the designed distance of the code, we describe an effective decoding procedure for some geometric codes on the Klein quartic.

apiary

工作

A direct proof for the automorphism group of reed solomon codes,We introduce a special basis for the description of the primitive extended cyclic codes, considered as subspaces of the modular algebra A=GF(p.)[GF(p.)]. Using properties of this basis, we determine the automorphism group of some extended cyclic codes, among the extended Reed Solomon codes.

反对

Covering radius of RM(1,9) in RM(3,9),We give new properties about Fourier coefficients and we prove that the distance of the first order Reed-Muller code of length 512 to any cubic is at most 240.

FILTH

incredulity

Inflammation

Decoding of codes on hyperelliptic curves,In 1989, R. Pellikaan gave an algorithm which decodes geometric codes up to .-errors, where .* is the designed distance of the code. Unfortunately this algorithm is not completely effective. I present facts about the jacobian of a hyperelliptic curve which permits in some cases to perform the algorithm.

急急忙忙

Decoding of codes on the klein quartic,Following R. Pellikaan who gave, in 1989, an algorithm which decodes geometric codes up to . errors where d* is the designed distance of the code, we describe an effective decoding procedure for some geometric codes on the Klein quartic.

漂白

Asymptotically good families of geometric goppa codes and the gilbert-varshamov bound,This note presents a generalization of the fact that most of the classical Goppa codes lie arbitrarily close to the Gilbert-Varshamov bound (cf. [2, p. 229]).

Complement