Results 1  10
of
6,998
Asymptotic Rates Of The Information Transfer Ratio
"... Information processing is performed when a system preserves aspects of the input related to what the input represents while it removes other aspects. To describe a system's information processing capability, input and output need to be compared in a way invariant to the way signals represent in ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
that this configuration has the capability to represent the input information without loss. We also derive bounds for asymptotic rates at which the loss decreases as more parallel systems are added and show that the rate depends on the input distribution.
A Simple Estimator of Cointegrating Vectors in Higher Order Cointegrated Systems
 ECONOMETRICA
, 1993
"... Efficient estimators of cointegrating vectors are presented for systems involving deterministic components and variables of differing, higher orders of integration. The estimators are computed using GLS or OLS, and Wald Statistics constructed from these estimators have asymptotic x2 distributions. T ..."
Abstract

Cited by 524 (3 self)
 Add to MetaCart
Efficient estimators of cointegrating vectors are presented for systems involving deterministic components and variables of differing, higher orders of integration. The estimators are computed using GLS or OLS, and Wald Statistics constructed from these estimators have asymptotic x2 distributions
Design of capacityapproaching irregular lowdensity paritycheck codes
 IEEE TRANS. INFORM. THEORY
, 2001
"... We design lowdensity paritycheck (LDPC) codes that perform at rates extremely close to the Shannon capacity. The codes are built from highly irregular bipartite graphs with carefully chosen degree patterns on both sides. Our theoretical analysis of the codes is based on [1]. Assuming that the unde ..."
Abstract

Cited by 588 (6 self)
 Add to MetaCart
We design lowdensity paritycheck (LDPC) codes that perform at rates extremely close to the Shannon capacity. The codes are built from highly irregular bipartite graphs with carefully chosen degree patterns on both sides. Our theoretical analysis of the codes is based on [1]. Assuming
Testing for Common Trends
 Journal of the American Statistical Association
, 1988
"... Cointegrated multiple time series share at least one common trend. Two tests are developed for the number of common stochastic trends (i.e., for the order of cointegration) in a multiple time series with and without drift. Both tests involve the roots of the ordinary least squares coefficient matrix ..."
Abstract

Cited by 464 (7 self)
 Add to MetaCart
has k unit roots and n k distinct stationary linear combinations. Our proposed tests can be viewed alternatively as tests of the number of common trends, linearly independent cointegrating vectors, or autoregressive unit roots of the vector process. Both of the proposed tests are asymptotically
Equivariant Adaptive Source Separation
 IEEE Trans. on Signal Processing
, 1996
"... Source separation consists in recovering a set of independent signals when only mixtures with unknown coefficients are observed. This paper introduces a class of adaptive algorithms for source separation which implements an adaptive version of equivariant estimation and is henceforth called EASI (Eq ..."
Abstract

Cited by 449 (9 self)
 Add to MetaCart
algorithm does not depend on the mixing matrix. In particular, convergence rates, stability conditions and interference rejection levels depend only on the (normalized) distributions of the source signals. Close form expressions of these quantities are given via an asymptotic performance analysis
Asymptotic Rate Limits for Randomized Broadcasting with Network Coding
"... Abstract—Motivated by peertopeer content distribution and media streaming applications, we study the broadcasting problem in a timediscretized model, with integer valued upload and download capacity constraints at nodes. We analyze both deterministic centralized and randomized decentralized proto ..."
Abstract
 Add to MetaCart
asymptotically achieve the optimal receiving rates in complete graphs with homogeneous node capacity. The proof involves applying randomized network coding and deriving the maxflow bounds achieved in the resulting transmission schedule. We extend the results to more general topologies, and bound the performance
Martingale asymptotic rates for records and δrecords†
, 2005
"... Initiated in the 50’s, the theory of records is nowadays an active area of research and applications in extreme value theory. As pointed out in [1], one source of dissatisfaction is the hypothesis that the underlying distribution F of observations is continuous. However, stimulated by applications ..."
Abstract
 Add to MetaCart
record which differs from records only in that an additive parameter δ is introduced in the defining inequality. We show here how asymptotic martingale results connect the counting process Nn of records and δrecords with partial sums of minima. Then we present laws of large numbers and central limit theorems
Numerical Results on the Asymptotic Rate of Binary Codes
"... . We compute upper bounds on the maximal size of a binary linear code of length n 1000, dimension k, and distance d For each value of d, the bound is found by solving the Delsarte linear programming problem. Relying on the results of the calculations, we discuss the known bounds on the size of codes ..."
Abstract
 Add to MetaCart
. We compute upper bounds on the maximal size of a binary linear code of length n 1000, dimension k, and distance d For each value of d, the bound is found by solving the Delsarte linear programming problem. Relying on the results of the calculations, we discuss the known bounds on the size of codes and some recent conjectures made about them. The most important conclusion is that Delsarte's linear programming method is unlikely to yield major improvements of the known general upper bounds on the size of codes. 1. Introduction: bounds on codes A codeC is a subset of the binary Hamming space H n 2 . The minimum distance between a pair of distinct points in C is called the distance of C, denoted d C One of the main problems of coding theory is to find the maximal size A n d of a code with given distance d. This problem is solved exactly only for some small values of n and d. The general results known are in the form of upper and lower bounds. The aim of this paper is to explore the l...
Good quantum error correcting codes exist
 REV. A
, 1996
"... A quantum errorcorrecting code is defined to be a unitary mapping (encoding) of k qubits (2state quantum systems) into a subspace of the quantum state space of n qubits such that if any t of the qubits undergo arbitrary decoherence, not necessarily independently, the resulting n qubits can be used ..."
Abstract

Cited by 349 (9 self)
 Add to MetaCart
be used to faithfully reconstruct the original quantum state of the k encoded qubits. Quantum errorcorrecting codes are shown to exist with asymptotic rate k/n = 1 − 2H2(2t/n) where H2(p) is the binary entropy function −p log2 p − (1 − p)log2(1 − p). Upper bounds on this asymptotic rate are given.
Asymptotic rate of quantum ergodicity in chaotic Euclidean billiards”, submitted
 Comm. Pure Appl. Math
"... The Quantum Unique Ergodicity (QUE) conjecture of RudnickSarnak is that every quantum (Laplace) eigenfunction φn of an ergodic, uniformlyhyperbolic classical geodesic flow becomes equidistributed in the semiclassical limit (eigenvalue En → ∞). We report numerical results on the rate of quantum erg ..."
Abstract

Cited by 36 (7 self)
 Add to MetaCart
The Quantum Unique Ergodicity (QUE) conjecture of RudnickSarnak is that every quantum (Laplace) eigenfunction φn of an ergodic, uniformlyhyperbolic classical geodesic flow becomes equidistributed in the semiclassical limit (eigenvalue En → ∞). We report numerical results on the rate of quantum
Results 1  10
of
6,998