A conceptually simple method for derivation of lower bounds on the error exponent of specific families of block codes used on classical-quantum channels with arbitrary signal states over a finite Hilbert space is presented. It is shown that families of binary block codes with appropriately rescaled binomial multiplicity enumerators used on binary classical-quantum channels and decoded by the su...

In this work, we introduce the notion of the error exponent region for a multi-user channel. This region specifies the set of error-exponent vectors that are simultaneously achievable by all users in the multi-user channel. This is done by associating different probabilities of error for different users, contrary to the traditional approach where a single probability of system error is consider...

We are interesting in the error exponent for source coding with fidelity criterion. For each fixed distortion level ∆, the maximum attainable error exponent at rate R, as a function of R, is called the reliability function. The minimum rate achieving the given error exponent is called the minimum achievable rate. For memoryless sources with finite alphabet, Marton (1974) gave an expression of t...

Despite studies clearly demonstrating significant benefit from increasing oxygen delivery in the peri-operative period in high risk surgical patients, the technique has not been widely accepted. This is due to a variety of reasons, including non-availability of beds, particularly in the pre-operative period, and the requirement of inserting a pulmonary artery catheter. There are now data that s...

We are developing a decision support system in an effort to assist biologists who are managing habitats for the Rocky Mountain population of trumpeter swans. Swan management is a domain that is ecologically complex, and this complexity is compounded by spatial and temporal issues. We are focused on providing decision support that allows managers to develop habitat management plans for local sit...

We show for a finite abelian group G and any element in the image of the Swan homomorphism sw : Z/|G|∗ −→ K̃0(ZG) that it can be realized as the finiteness obstruction of a finitely dominated connected CW -complex X with fundamental group π1(X) = G such that π1(X) is equal to the subgroup G1(X) defined by Gottlieb. This is motivated by the observation that any H-space X satisfies π1(X) = G1(X) a...

We introduce the Swan class of an -adic etale sheaf on a variety over a local field. It is a generalization of the classical Swan conductor measuring the wild ramification and is defined as a 0-cycle class supported on the reduction. We establish a Riemann-Roch formula for the Swan class. Let K be a complete discrete valuation field of characteristic 0. We assume that the residue field F is a p...