Proceedings of 1994 IEEE International Symposium on Information Theory

June 27 1994-July 1 1994

Filter Results

Displaying Results 1 - 25 of 507
  • Erasure, list and detection zero-error capacities for low noise and a relation to identification

    Publication Year: 1994
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (46 KB)

    Summary form only given. We study discrete memoryless channels. Our results concern codes with zero-error probabilities for decisions: transmission codes under two criteria, the erasure probability and the average list size; and identification codes with zero-error probability for misrejection.<> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the performance of coded/shaped modulation

    Publication Year: 1994
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (93 KB)

    An upper bound on the error probability of a shaped modulation scheme is derived. The bound shows that nonequiprobable signaling affects the performance in two ways. First, it reduces the average signal energy which contributes positively to the shaping gain. Second, it reduces the "equivalent minimum distance" of the signal set relative to the noise level which contributes negatively to the shapi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A class of Neyman-Pearson and Bayes learning algorithms for neural classification

    Publication Year: 1994
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (74 KB)

    Summary form only given. We focus our attention on neural networks whose objective is hypothesis testing. The term hypothesis testing refers to a very broad class of problems, including classification, detection and pattern recognition. There is not much doubt about the way we can measure the performance of a classifier or detector. When the prior probabilities are known, we use the probability of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A statistical analysis of neural computation

    Publication Year: 1994
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (72 KB)

    Summary form only given. This paper presents an architecture and learning algorithm for a feedforward neural network implementing a two pattern (image) classifier. By considering the input pixels to be random variables, a statistical binary hypothesis (likelihood ratio) test is implemented. A linear threshold separates p[X|H/sub 0/] and p[X|H/sub 1/], minimizing a risk function. In this manner, a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the construction of real number trellis codes

    Publication Year: 1994
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (95 KB)

    This paper studies the optimization of real number trellis codes without using the decomposition into a binary convolutional encoder and a mapper that transforms binary codewords into modulated signals. A simulated annealing algorithm is used to find the best labeling of a geometrically uniform trellis code on the real field.<> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized Berlekamp-Massey decoding of algebraic geometry codes up to half the Feng-Rao bound

    Publication Year: 1994
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (60 KB)

    Summary form only given, as follows. Efficient decoding of BCH- and Reed-Solomon codes can be done using the Berlekanp-Massey (1969) algorithm, and it is natural to try to use the extension of this to N dimensions of Sakata (see Inform. Computat., vol.84, no.2, p.207, 1990) to decode algebraic geometry codes. We treat a general class of algebraic geometry codes and show how to decode these up to h... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved geometric Goppa codes

    Publication Year: 1994
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (83 KB)

    Summary form only given. A new class of geometric Goppa codes are discussed. We show that the improved geometric Goppa codes are more efficient than the current geometric Goppa codes, for many cases. We also show several improved geometric Goppa codes from algebraic curves in high-dimensional spaces, hyperplanes in affine spaces and projective spaces, surfaces in affine spaces, and some varieties ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some results on biorthogonal-like functions for generalized Gabor expansions

    Publication Year: 1994
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (100 KB)

    Summary form only given. The decomposition and representation of signals in the joint time-frequency domain are increasingly useful in communication and information theory, and in signal processing. Given a countable collection of functions in the joint time-frequency domain, we may find another countable collection of joint time-frequency functions, such that any signal can be represented in term... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Kalman like filtering and smoothing for reciprocal sequences

    Publication Year: 1994
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (110 KB)

    The MMSE filtering problem of reciprocal Gaussian sequences in additive white Gaussian noise is solved in a recursive and causal form. The solution, based on the innovations method, is expressed in terms of a set of recursive equations formally similar to those of the well-known Kalman filter; it gives as by-product the solution of the MMSE smoothing problems (fixed-point, fixed-interval, fixed-la... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semidynamic and dynamic transmission algorithms for multiplexing voice with data

    Publication Year: 1994
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (79 KB)

    Summary form only given. We are concerned with the problem of multiplexing voice and low speed data traffic over a common digital channel for transmission, where the voice traffic has priority over the data traffic, and where the arrival process of the voice traffic may be time-varying. The issue is then dynamic or semi-dynamic allocation of the channel capacity dedicated to voice versus data tran... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Applications of error-correcting codes to orthogonal arrays and the design of experiments

    Publication Year: 1994
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (49 KB)

    Summary form only given. An account is given of recent work by the author and his colleagues on the application of techniques from error-correcting codes to the design of experiments.<> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of overlapping multi-pulse pulse position modulation (OMPPM) in noisy photon counting channel

    Publication Year: 1994
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (92 KB)

    Summary form only given. Overlapping multi-pulse pulse position modulation (OMPPM) is a modulation scheme to achieve a higher throughput than other conventional modulation schemes. Ohtsuki, Sasase and Mori (see Conf. Rec. ICC'93, p.1123-1127, 1993) analyzed OPPM in a noiseless photon counting channel and showed that it outperforms other conventional modulations. The optical channel is often modele... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On automorphism groups of binary primitive BCH codes

    Publication Year: 1994
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (88 KB)

    It is proved that, for a given m/spl ges/5, the automorphism group Aut(C) of a binary primitive BCH code C of length 2/sup m/-1 with Bose distance d/sub 0/, 3/spl les/d/sub 0/-1<1+2[/sup m+3///sub 4/], consists of only traditional permutations. Automorphism groups of several classes of binary primitive BCH codes are determined. These include binary primitive BCH codes with Bose distance d/sub 0/=2... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Magnetic recording as a communications channel

    Publication Year: 1994
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (36 KB)

    Summary form only given. An often used model for a digital magnetic recording channel is to describe the input as a continuous waveform that takes on only one of two values (say +A and -A) and to describe the output as the sum of a linearly filtered version of the input and independent Gaussian noise. One aim of the article is to explain how this simple model need to be modified to take into accou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information and control

    Publication Year: 1994
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (47 KB)

    Summary form only given. The main theme of the article is to discuss how to associate a value with information in the context of control. It concludes with a discussion of some differences between control and communication. Two issues are time delays and computational requirements.<> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proceedings of 1994 IEEE International Symposium on Information Theory

    Publication Year: 1994
    Request permission for commercial reuse | |PDF file iconPDF (44 KB)
    Freely Available from IEEE
  • A bound on the unequal error protection capabilities of rate k/n convolutional codes

    Publication Year: 1994
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (94 KB)

    In a previous paper by Mills and Costello (see ibid., p.114, 1993) the effective free distance vector of a convolutional encoder was defined. This paper presents a new bound relating two individual effective free distances. Evaluating the bound is a useful tool in determining the possible unequal error protection capabilities of encoders of specified rate and memory distribution. In addition, the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On parameter estimation for quantum processes

    Publication Year: 1994
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (37 KB)

    Summary form only given, as follows. A comparative discussion of three basic procedures of continuous quantum measurement for estimating parameters of quantum stochastic processes is presented. Quantum stochastic process is one-parameter family of (vector) operators in a Hilbert space, together with a density operator, defining quantum state. If the density operator depends on unknown parameters, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New rotationally invariant trellis codes with multidimensional signal constellations

    Publication Year: 1994
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (103 KB)

    In this paper, the construction of rotationally invariant trellis codes with multidimensional signal constellations is discussed. Linear and nonlinear trellis codes with constraint lengths /spl nu/=2-8 are found using a systematic search. Simulation results show that a /spl nu/=8, linear, 180/spl deg/ rotationally invariant code and a /spl nu/=8, nonlinear, 90/spl deg/ rotationally invariant code ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Key distribution schemes

    Publication Year: 1994
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (97 KB)

    A key distribution scheme is a method used to distribute off-line initial private pieces of information among a set of users, such that each group of them can compute a common key for secure conference. This information is generated and distributed by a trusted server which is active only at the distribution phase. Key distribution is a central problem in cryptographic systems, and is a major comp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dual codes of linear block codes over abelian groups

    Publication Year: 1994
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (72 KB)

    The dual code of a linear code over an abelian group is characterized in terms of the endomorphisms of the abelian group View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decomposition and construction of group codes

    Publication Year: 1994
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (76 KB)

    A decomposition of a group code into a normal subcode and a quotient code can be characterized as group extension (extension code) of the subcode and the quotient code. Simple necessary and sufficient conditions are given for the existence of an extension code with given sub- and quotient code. These purely algebraic results are complemented by a characterization of finitely generated, complete, k... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Subliminal-free sharing schemes

    Publication Year: 1994
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (64 KB)

    Since Simmons (1984) discussed the fact that a secret message, which he called a subliminal channel, can be hidden inside the authenticator, many subliminal-free cryptosystems have been presented. We present a subliminal-free key distribution phase for a secret sharing scheme with a general access structure and discuss subliminal-free recomputation View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Anti-jamming on the OR-channel

    Publication Year: 1994
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (72 KB)

    We propose a frequency hopping scheme with M-ary frequency shift keying applied to the OR-channel and give its error and erasure probabilities. Asymptotically, the bit error probability is bounded away from zero whereas it polynomially tends to zero for our previously proposed generalized scheme View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the information rate of perfect secret sharing schemes

    Publication Year: 1994
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (80 KB)

    We present a method to derive information theoretical upper bounds on the information rate and average information rate of perfect secret sharing schemes. One of the applications is that in perfect secret sharing schemes for some access structures the shares need to be impractically large View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.