In this paper we present a developed software in the area of Coding Theory. Using it, codes with given properties can be classified. A part of this software can be used also for investigations (isomorphisms, automorphism groups) of other discrete structures-combinatorial designs, Hadamard matrices, bipartite graphs etc.
The problem of efficient computing of the affine vector operations (addition of two vectors and multiplication of a vector by a scalar over GF (q)), and also the weight of a given vector, is important for many problems in coding theory, cryptography, VLSI technology etc. In this paper we propose a new way of representing vectors over GF (3) and GF (4) and we describe an efficient performance of these affine operations. Computing weights of binary vectors is also discussed.
In this article, we study two representations of a Boolean function which are very important in the context of cryptography. We describe Möbius and Walsh Transforms for Boolean functions in details and present effective algorithms for their implementation. We combine these algorithms with the Gray code to compute the linearity, nonlinearity and algebraic degree of a vectorial Boolean function. Such a detailed consideration will be very helpful for students studying the design of block ciphers, including...
Methods for representing equivalence problems of various combinatorial objects as graphs or binary matrices are considered. Such representations can be used for isomorphism testing in classification or generation algorithms. Often it is easier to consider a graph or a binary matrix isomorphism problem than to implement heavy algorithms depending especially on particular combinatorial objects. Moreover, there already exist well tested algorithms for the graph isomorphism problem (nauty) and the...
This paper presents developed software in the area of Coding Theory. Using it, all binary self-dual codes with given properties can be classified. The programs have consequent and parallel implementations. ACM Computing Classification System (1998): G.4, E.4.
Page 1