504 research outputs found
Critical Noise Levels for LDPC decoding
We determine the critical noise level for decoding low density parity check
error correcting codes based on the magnetization enumerator (\cM), rather
than on the weight enumerator (\cW) employed in the information theory
literature. The interpretation of our method is appealingly simple, and the
relation between the different decoding schemes such as typical pairs decoding,
MAP, and finite temperature decoding (MPM) becomes clear. In addition, our
analysis provides an explanation for the difference in performance between MN
and Gallager codes. Our results are more optimistic than those derived via the
methods of information theory and are in excellent agreement with recent
results from another statistical physics approach.Comment: 9 pages, 5 figure
JPKWIC - General key word in context and subject index report generator
JPKWIC computer program is a general key word in context and subject index report generator specifically developed to help nonprogrammers and nontechnical personnel to use the computer to access files, libraries and mass documentation. This program is designed to produce a KWIC index, a subject index, an edit report, a summary report, and an exclusion list
Statistical Mechanics of Dictionary Learning
Finding a basis matrix (dictionary) by which objective signals are
represented sparsely is of major relevance in various scientific and
technological fields. We consider a problem to learn a dictionary from a set of
training signals. We employ techniques of statistical mechanics of disordered
systems to evaluate the size of the training set necessary to typically succeed
in the dictionary learning. The results indicate that the necessary size is
much smaller than previously estimated, which theoretically supports and/or
encourages the use of dictionary learning in practical situations.Comment: 6 pages, 4 figure
Error-correcting code on a cactus: a solvable model
An exact solution to a family of parity check error-correcting codes is
provided by mapping the problem onto a Husimi cactus. The solution obtained in
the thermodynamic limit recovers the replica symmetric theory results and
provides a very good approximation to finite systems of moderate size. The
probability propagation decoding algorithm emerges naturally from the analysis.
A phase transition between decoding success and failure phases is found to
coincide with an information-theoretic upper bound. The method is employed to
compare Gallager and MN codes.Comment: 7 pages, 3 figures, with minor correction
Statistical mechanics of typical set decoding
The performance of ``typical set (pairs) decoding'' for ensembles of
Gallager's linear code is investigated using statistical physics. In this
decoding, error happens when the information transmission is corrupted by an
untypical noise or two or more typical sequences satisfy the parity check
equation provided by the received codeword for which a typical noise is added.
We show that the average error rate for the latter case over a given code
ensemble can be tightly evaluated using the replica method, including the
sensitivity to the message length. Our approach generally improves the existing
analysis known in information theory community, which was reintroduced by
MacKay (1999) and believed as most accurate to date.Comment: 7 page
Survey propagation for the cascading Sourlas code
We investigate how insights from statistical physics, namely survey
propagation, can improve decoding of a particular class of sparse error
correcting codes. We show that a recently proposed algorithm, time averaged
belief propagation, is in fact intimately linked to a specific survey
propagation for which Parisi's replica symmetry breaking parameter is set to
zero, and that the latter is always superior to belief propagation in the high
connectivity limit. We briefly look at further improvements available by going
to the second level of replica symmetry breaking.Comment: 14 pages, 5 figure
Typical Performance of Gallager-type Error-Correcting Codes
The performance of Gallager's error-correcting code is investigated via
methods of statistical physics. In this approach, the transmitted codeword
comprises products of the original message bits selected by two
randomly-constructed sparse matrices; the number of non-zero row/column
elements in these matrices constitutes a family of codes. We show that
Shannon's channel capacity is saturated for many of the codes while slightly
lower performance is obtained for others which may be of higher practical
relevance. Decoding aspects are considered by employing the TAP approach which
is identical to the commonly used belief-propagation-based decoding.Comment: 6 pages, latex, 1 figur
Cryptographical Properties of Ising Spin Systems
The relation between Ising spin systems and public-key cryptography is
investigated using methods of statistical physics. The insight gained from the
analysis is used for devising a matrix-based cryptosystem whereby the
ciphertext comprises products of the original message bits; these are selected
by employing two predetermined randomly-constructed sparse matrices. The
ciphertext is decrypted using methods of belief-propagation. The analyzed
properties of the suggested cryptosystem show robustness against various
attacks and competitive performance to modern cyptographical methods.Comment: 4 pages, 2 figure
Analysis of CDMA systems that are characterized by eigenvalue spectrum
An approach by which to analyze the performance of the code division multiple
access (CDMA) scheme, which is a core technology used in modern wireless
communication systems, is provided. The approach characterizes the objective
system by the eigenvalue spectrum of a cross-correlation matrix composed of
signature sequences used in CDMA communication, which enables us to handle a
wider class of CDMA systems beyond the basic model reported by Tanaka. The
utility of the novel scheme is shown by analyzing a system in which the
generation of signature sequences is designed for enhancing the orthogonality.Comment: 7 pages, 2 figure
On-line learning of non-monotonic rules by simple perceptron
We study the generalization ability of a simple perceptron which learns
unlearnable rules. The rules are presented by a teacher perceptron with a
non-monotonic transfer function. The student is trained in the on-line mode.
The asymptotic behaviour of the generalization error is estimated under various
conditions. Several learning strategies are proposed and improved to obtain the
theoretical lower bound of the generalization error.Comment: LaTeX 20 pages using IOP LaTeX preprint style file, 14 figure
- …