The 2000 International Symposium on Information Theory and
Its Applications (ISITA2000) took place in Honolulu, U.S.A.,
in November 2000. It was the 5-th Symposium in the ISITA's
program, which is running since 1990. This time the Symposium
was held in conjunction with the IEEE International Symposium
on Intelligent Signal Processing and Communication Systems
(ISPAC2000).
The program contained of 244 papers presented by the authors
from 30 countries. The 4-page abstracts are published in 2 volumes
of the Proceedings. 5 papers from the list of contributions that
attracted our attention are mentioned below.
J. Justesen and N. Jensen in the paper
``A new upper bound on the first event error probability for
convolutional codes''
improved the union bound on the first event decoding error
probability for specific convolutional codes used to transmit
data over a binary symmetric channel.
M. Mohri and M. Morii in the paper
``An algorithm for computing the local distance profile of cyclic
codes''
proposed efficient computational algorithm for constructing the
list
of Voronoi neighbours for binary cyclic codes.
C. Retter in the paper
``Bounds on list decoding for binary expansions of Reed--Solomon
codes''
presented some results concerning the spectrum characteristics
of the
ensemble of generalized Reed-Solomon codes, which are relevant
to list
decoding.
M. Chiang, A. Sutivong, and T. M. Cover in the paper
``Channel capacity and state estimation''
addressed the problem when the encoder has to transmit both the
message
and a realization of a Gaussian process over a Gaussian channel;
the
message should be decoded with the small decoding error probability,
while the process should be reconstructed with a certain distortion
measured by the Euclidean distance.
A. Poli and M.-C. Gennero in the paper
``Synchronization from roots of polynomials''
derived a good upper bound on the probability that a randomly
chosen
polynomial has a certain number of roots in the field containing
its
coefficients.