Titlebook: Algebraic Algorithms and Error-Correcting Codes; 3rd International Co Jacques Calmet Conference proceedings 1986 Springer-Verlag Berlin Hei

不规则的跳动

Era Dabla-Norris,John M. Matovu,Paul R. Wadezation of Lloyd‘s Theorem, and use these conditions to prove some characterization theorems. In particular, we shall characterize the punctured Golay codes and an infinite class of strongly tactical codes.

无力更进

synovium

Thomas Poufinas,Evaggelos Drimpetasliminary versions of this paper were presented at the IEEE International Symposium on Information Theory, Brighton, June 24–28, 1985, and at AAECC, the 3rd International Conference on Applied Algebra, Algebraic Algorithms, and Error-correcting Codes, Grenoble, July 15–19, 1985.

Wordlist

PAGAN

水土

Numerical experiments related to the covering radius of some first order Reed-Muller codes, some matrix groups acting on the field GF(2.) viewed as a GF(2)-vector space. The coset leaders so obtained are characteristic functions of subsets of GF(2.) that are union of orbits under the considered group and often have interesting combinatorial properties generalizing difference sets.

不幸的人

Several aspects of problems encountered in coding applications,ation, teledetection, confidentiality...where a set of chronic problems appear..An analysis of the principles issues follows..The theorician defines codes which have properties stemming from their algebraic structure, and their exploitation allows the correction of a finite number of error configura

inquisitive

不能仁慈

Orthogonal transform encoding of cyclic codes,does not coincide with but is a subfield of the spectral domain. In this paper we develop an algorithm for calculating the IDFT that overcomes the resulting disadvantages. The orthogonal transform encoding of cyclic codes is used for the demonstration of the results.

誓言

The finite Fourier-transform and theta functions,e morphism of Abelian varieties. This is explained in the context of the representation theory of the finite symplectic group. Finally the MacWilliams identities in coding theory are discussed in the light of the theory of theta functions.