30 GENETIC CODES, MATRICES, AND SYMMETRICAL TECHNIQUES
different methods and in different directions of thought (see, e.g., MacDonaill,
2003 ). Our own research, presented in this chapter, which is based on the idea
of a deep connection between structures of the genetic code and the require-
ment for noise immunity of genetic information, is quite original in the research
methods used and in the new facts obtained.
Let us discuss the noise - immunity property of genetic systems more deeply.
It seems fantastic, but descendants grow similar to their ancestors due to
genetic information, despite enormous disturbances and noise in trillions of
biological molecules. How is it possible to approach this problem of such fan-
tastic noise immunity in molecular genetics? Does modern science have any
precedents from similar problems of noise immunity?
Yes; science has successfully solved a similar task recently: the noise -
immunity transfer of photos from surfaces of other planets to the Earth. In
this task, electromagnetic signals, which carry data, should pass through mil-
lions of kilometers of cosmic space full of electromagnetic disturbances. These
disturbances transform signals tremendously, but modern mathematical tech-
nology permits one to restore a transferred photo qualitatively.
The solution to this problem became possible due to the theory of noise -
immunity coding created by mathematicians. This theory has appeared rather
recently; initial basic work in this fi eld was published by Hamming in 1950
(Hamming, 1980 ). The theory of such coding utilizes intensive matrix mathe-
matics, including the representation of sets of signals and codes in the form of
matrices and their Kronecker powers. Our book describes many interesting
results in the fi eld of molecular genetics and bioinformatics which were
obtained by its authors on the basis of such matrix mathematics. The investiga-
tion of the genetic code from the viewpoint of the theory of discrete signals
is natural because of the discrete character of the code.
Coding in modern digital techniques is generally utilized not to prevent
reading of text by unauthorized users but to provide technical ease of transfer
of discrete information with high noise immunity, speed, and reliability. The
most famous example of codes is the Morse code, but of course modern codes
are much more effective than the Morse code. These codes allow us to transfer
capacious amounts of information across great distances qualitatively.
Orthogonal codes, which use Hadamard matrices, is one such code (Ahmed
and Rao, 1975 ; Blahut, 1985 ; Geadah and Corinthios, 1977 ; Lee and Kaveh,
1986 ; Peterson and Weldon, 1972 ; Petoukhov, 2008a,b ; Sklar, 2001 ; Trahtman,
1972 ; Trahtman and Trahtman, 1975 ; Yarlagadda and Hershey, 1997 ). Any
signal transmitted consists of a set of elementary signals (a component of a
signal vector of an appropriate dimension). The task of the receiver in condi-
tions of noise is the approximate defi nition of a concrete vector signal which
has been sent from a known set of vector signals (Sklar, 2001 ). Application of
Hadamard matrices allows us to solve similar problems by means of the spec-
tral decomposition of vector signals and the transfer of their spectra, on the
basis of which the receiver restores an initial signal. This decomposition utilizes
orthogonal functions of rows of Hadamard matrices (Ahmed and Rao, 1975 ).