The Experts below are selected from a list of 318 Experts worldwide ranked by ideXlab platform
Dan Stahlke - One of the best experts on this subject based on the ideXlab platform.
-
Quantum Zero-Error Source-Channel Coding and Non-Commutative Graph Theory
IEEE Transactions on Information Theory, 2016Co-Authors: Dan StahlkeAbstract:Alice and Bob receive a bipartite state (possibly entangled) from some finite collection or from some subspace. Alice sends a message to Bob through a noisy quantum channel such that Bob may determine the initial state, with zero chance of error. This framework encompasses, for example, teleportation, dense coding, entanglement assisted quantum channel capacity, and one-way communication complexity of function evaluation. With classical sources and channels, this problem can be analyzed using graph Homomorphisms. We show this quantum version can be analyzed using Homomorphisms on non-commutative graphs (an operator space generalization of graphs). Previously the Lovász ϑ number has been generalized to non-commutative graphs; we show this to be a Homomorphism monotone, thus providing bounds on quantum source-channel coding. We generalize the Schrijver and Szegedy numbers, and show these to be monotones as well. As an application, we construct a quantum channel whose entanglement assisted zero-error one-shot capacity can only be unlocked using a non-maximally entangled state. These Homomorphisms allow definition of a chromatic number for non-commutative graphs. Many open questions are presented regarding the possibility of a more fully developed theory.
-
quantum zero error source channel coding and non commutative graph theory
IEEE Transactions on Information Theory, 2016Co-Authors: Dan StahlkeAbstract:Alice and Bob receive a bipartite state (possibly entangled) from some finite collection or from some subspace. Alice sends a message to Bob through a noisy quantum channel such that Bob may determine the initial state, with zero chance of error. This framework encompasses, for example, teleportation, dense coding, entanglement assisted quantum channel capacity, and one-way communication complexity of function evaluation. With classical sources and channels, this problem can be analyzed using graph Homomorphisms. We show this quantum version can be analyzed using Homomorphisms on non-commutative graphs (an operator space generalization of graphs). Previously the Lovasz $\vartheta $ number has been generalized to non-commutative graphs; we show this to be a Homomorphism monotone, thus providing bounds on quantum source-channel coding. We generalize the Schrijver and Szegedy numbers, and show these to be monotones as well. As an application, we construct a quantum channel whose entanglement assisted zero-error one-shot capacity can only be unlocked using a non-maximally entangled state. These Homomorphisms allow definition of a chromatic number for non-commutative graphs. Many open questions are presented regarding the possibility of a more fully developed theory.
Qinhua Hu - One of the best experts on this subject based on the ideXlab platform.
-
data compression with Homomorphism in covering information systems
International Journal of Approximate Reasoning, 2011Co-Authors: Changzhong Wang, Degang Chen, Chong Wu, Qinhua HuAbstract:In reality we are always faced with a large number of complex massive databases. In this work we introduce the notion of a Homomorphism as a kind of tool to study data compression in covering information systems. The concepts of consistent functions related to covers are first defined. Then, by classical extension principle the concepts of covering mapping and inverse covering mapping are introduced and their properties are studied. Finally, the notions of Homomorphisms of information systems based on covers are proposed, and it is proved that a complex massive covering information system can be compressed into a relatively small-scale information system and its attribute reduction is invariant under the condition of Homomorphism, that is, attribute reductions in the original system and image system are equivalent to each other.
Xiaotian Wu - One of the best experts on this subject based on the ideXlab platform.
-
reversible data hiding in encrypted images with additive and multiplicative public key Homomorphism
Signal Processing, 2019Co-Authors: Bing Chen, Xiaotian Wu, Wei LuAbstract:Abstract Public-key Homomorphism is an efficient technique of reversible data hiding in encrypted images (RDH-EI). The existing public-key Homomorphism based RDH-EI schemes benefit from the additive Homomorphism of public-key encryption. In this paper, a theoretical analysis of public-key Homomorphism based RDH-EI is given, which makes both additive Homomorphism and multiplicative Homomorphism available. Thus more homomorphic public-key encryptions can be used to construct RDH-EI schemes. By the theoretical analysis, lossless recovery of directly decrypted image is obtained. And the embedding rate can reach 1 bit per pixel (bpp) or more regardless of the pixel distribution of natural images. In addition, two novel public-key Homomorphism based RDH-EI schemes using additive Homomorphism and multiplicative Homomorphism, respectively, are introduced. Experimental results are presented to illustrate the effectiveness and superiority of the proposed methods.
Changzhong Wang - One of the best experts on this subject based on the ideXlab platform.
-
data compression with Homomorphism in covering information systems
International Journal of Approximate Reasoning, 2011Co-Authors: Changzhong Wang, Degang Chen, Chong Wu, Qinhua HuAbstract:In reality we are always faced with a large number of complex massive databases. In this work we introduce the notion of a Homomorphism as a kind of tool to study data compression in covering information systems. The concepts of consistent functions related to covers are first defined. Then, by classical extension principle the concepts of covering mapping and inverse covering mapping are introduced and their properties are studied. Finally, the notions of Homomorphisms of information systems based on covers are proposed, and it is proved that a complex massive covering information system can be compressed into a relatively small-scale information system and its attribute reduction is invariant under the condition of Homomorphism, that is, attribute reductions in the original system and image system are equivalent to each other.
Wei Lu - One of the best experts on this subject based on the ideXlab platform.
-
reversible data hiding in encrypted images with additive and multiplicative public key Homomorphism
Signal Processing, 2019Co-Authors: Bing Chen, Xiaotian Wu, Wei LuAbstract:Abstract Public-key Homomorphism is an efficient technique of reversible data hiding in encrypted images (RDH-EI). The existing public-key Homomorphism based RDH-EI schemes benefit from the additive Homomorphism of public-key encryption. In this paper, a theoretical analysis of public-key Homomorphism based RDH-EI is given, which makes both additive Homomorphism and multiplicative Homomorphism available. Thus more homomorphic public-key encryptions can be used to construct RDH-EI schemes. By the theoretical analysis, lossless recovery of directly decrypted image is obtained. And the embedding rate can reach 1 bit per pixel (bpp) or more regardless of the pixel distribution of natural images. In addition, two novel public-key Homomorphism based RDH-EI schemes using additive Homomorphism and multiplicative Homomorphism, respectively, are introduced. Experimental results are presented to illustrate the effectiveness and superiority of the proposed methods.
