University of Pittsburgh
Publishes on Algorithms and Data Compression, Advanced Wireless Communication Techniques, Coding theory and cryptography. 17 papers and 202 citations.
Add your photo, update your bio, and get notified when your ranking changes.
Neural network models are receiving increasing attention because of their collective computational capabilities. We evaluate the use of the Hopfield neural network model in optically determining the nearest-neighbor of a binary bipolar test vector from a set of binary bipolar reference vectors. The use of the Hopfield model is compared with that of a direct technique called direct storage nearest-neighbor that accomplishes the task of nearest-neighbor determination.
The problem of achieving synchronization for variable-length source codes is addressed through the use of self-synchronizing binary prefix-condition codes. Although our codes are suboptimal in the sense of minimum average codeword length, they have the advantages of being generated by an explicit constructive algorithm, having minimal additional redundancy compared with optimal codes-as little as one additional bit introduced into the least likely codeword for a large class of sources-and having statistical synchronizing performance that improves on that of the optimal code in many cases.
A new lower bound, which is the tightest possible, is obtained for the redundancy of optimal bimuy prefix-condition (OBPC) codes for a memoryless source for which the probability of the most likely source letter is known. It is shown that this bound, and upper bounds obtained by Gallager and Johnsen, hold for infinite as well as finite source alphabets. Also presented are bounds on the redundancy of OBPC codes for sources satisfying the condition that each of the first several probabilities in the list of source probabilities is sufficiently large relative to the sum of the remaining probabilities.
Although optimal binary source coding using symbol blocks of increasing length must eventually yield a code having an average codeword length arbitrarily close to the source entropy, it is known that the sequence of average codeword lengths need not be nonincreasing. The sequence is, however, bounded above by the average codeword length of the source, and certain subsequences must be nondecreasing. Sufficient conditions are obtained describing sources for which a decrease in average codeword length is achieved when coding pairs of symbols. A sufficient condition specifying sources for which no such decrease is possible is also obtained.
t-random-error correcting and all-unidirectional-error detecting (t-EC/AUED) codes obtained by appending a suffix to each codeword of a linear block code are presented. Although this technique has been previously used to construct such codes, a different approach is proposed that involves starting with a nonoptimal t-EC linear code to obtain more efficient t-EC/AUED codes. Specifically, t-EC/AUED codes constructed from an even-weight t-EC linear code are shown to require a shorter suffix than when a general t-EC linear code is used. The t-EC/AUED codes obtained in this manner are thoroughly compared to the best known codes, and are shown to require fewer bits in almost all cases.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>