Geodesic

Tome 17 (2005) no. 4

Sommaire

K.\,A.~Rybnikov (August 18, 1913--August 8, 2004)
p. 3-6
A new class of nonlinear quinary codes
p. 7-17
Extensions of information protocols based on mappings of finite sets
p. 18-28
On the property of decomposability of functions of $k$-valued logic related to summation of $n$-dependent random variables in a finite Abelian group
p. 29-39
On the distribution of the $m$th maximal cycle lengths of random $A$-permutations
p. 40-58
The law of large numbers for permanents of random matrices
p. 59-71
Generation of uniform distribution robust to nonequiprobability of the initial digits
p. 72-80
On cardinality of some subclasses of monotone functions
p. 81-97
On the affinity level of Boolean functions
p. 98-107
On minimal $\pi$-circuits of closing contacts for symmetric functions with threshold~2
p. 108-110
The representability of a Boolean function by a repetition-free formula can be verified by a circuit of linear complexity
p. 111-115
On the complexity of the computation of a pair of monomials in two variables
p. 116-142
A~generalisation of quadratic residue codes to the case of cubic and biquadratic residues
p. 143-149
The choice of optimisation criterion in the uniform assignment problem
p. 150-157