FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W4386075146> ?p ?o ?g. }

• W4386075146 abstract "In this paper, we put forward the model of zero-error distributed function compression system of two binary memoryless sources X and Y as depicted in Fig. 1. In the model, there are two encoders En1 and En2 and one decoder De, connected by two channels with capacity constraints C <inf xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>1</inf> and C <inf xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2</inf> , respectively. The encoder En1 can observe X or (X, Y), and the encoder En2 can observe Y or (X, Y). Here, we use two switches s <inf xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>1</inf> and s <inf xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2</inf> open or closed (taking values 0 or 1) to represent whether En1 can observe Y and En2 can observe X, respectively. The decoder De is required to compress the binary arithmetic sum f(X, Y) = X + Y with zero error by using the system multiple times. We use (s <inf xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>1</inf> s <inf xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2</inf> ; C <inf xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>1</inf> , C <inf xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2</inf> ; f) to denote the model. The compression capacity is defined as the maximum average number of times that the function f can be compressed with zero error for one use of the system, which measures the efficiency for using the system. In the paper, the compression capacities for all the four models are fully characterized. Amongst them, the characterization of the compression capacity for (01; C <inf xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>1</inf> , C <inf xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2</inf> ; f) is very difficult. Toward this end, we develop a novel graph coloring approach in the converse part and the proof is highly nontrivial. Furthermore, we apply the compression capacity for (01; C <inf xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>1</inf> , C <inf xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2</inf> ; f) to the open problem in network function computation that whether the best known upper bound by Guang et al. on computing capacity is in general tight. This upper bound is always tight for all previously considered network function computation problems whose computing capacities are known. By considering equivalent network function computation models of (01; C <inf xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>1</inf> , C <inf xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2</inf> ; f), we give the answer that in general the upper bound of Guang et al. is not tight." @default.
• W4386075146 created "2023-08-23" @default.
• W4386075146 creator A5027528912 @default.
• W4386075146 creator A5043058794 @default.
• W4386075146 date "2023-06-25" @default.
• W4386075146 modified "2023-10-16" @default.
• W4386075146 title "Zero-Error Distributed Function Compression" @default.
• W4386075146 cites W1545658340 @default.
• W4386075146 cites W1995875735 @default.
• W4386075146 cites W2001498781 @default.
• W4386075146 cites W2019307453 @default.
• W4386075146 cites W2026641099 @default.
• W4386075146 cites W2038488239 @default.
• W4386075146 cites W2044716089 @default.
• W4386075146 cites W2071801393 @default.
• W4386075146 cites W2078289947 @default.
• W4386075146 cites W2099213070 @default.
• W4386075146 cites W2105831729 @default.
• W4386075146 cites W2106403318 @default.
• W4386075146 cites W2115602633 @default.
• W4386075146 cites W2119336214 @default.
• W4386075146 cites W2123562143 @default.
• W4386075146 cites W2128106480 @default.
• W4386075146 cites W2129119419 @default.
• W4386075146 cites W2134804253 @default.
• W4386075146 cites W2138928022 @default.
• W4386075146 cites W2146247100 @default.
• W4386075146 cites W2150412388 @default.
• W4386075146 cites W2164437783 @default.
• W4386075146 cites W2164651000 @default.
• W4386075146 cites W2164684058 @default.
• W4386075146 cites W2172236196 @default.
• W4386075146 cites W2255519029 @default.
• W4386075146 cites W2886140273 @default.
• W4386075146 cites W2962789451 @default.
• W4386075146 cites W2963843956 @default.
• W4386075146 cites W2963928051 @default.
• W4386075146 cites W2963944130 @default.
• W4386075146 cites W2964259786 @default.
• W4386075146 cites W3098321199 @default.
• W4386075146 cites W4205523767 @default.
• W4386075146 cites W4205946516 @default.
• W4386075146 cites W4212896000 @default.
• W4386075146 doi "https://doi.org/10.1109/isit54713.2023.10206553" @default.
• W4386075146 hasPublicationYear "2023" @default.
• W4386075146 type Work @default.
• W4386075146 citedByCount "0" @default.
• W4386075146 crossrefType "proceedings-article" @default.
• W4386075146 hasAuthorship W4386075146A5027528912 @default.
• W4386075146 hasAuthorship W4386075146A5043058794 @default.
• W4386075146 hasConcept C111919701 @default.
• W4386075146 hasConcept C11413529 @default.
• W4386075146 hasConcept C114614502 @default.
• W4386075146 hasConcept C118505674 @default.
• W4386075146 hasConcept C138885662 @default.
• W4386075146 hasConcept C14036430 @default.
• W4386075146 hasConcept C184720557 @default.
• W4386075146 hasConcept C2780813799 @default.
• W4386075146 hasConcept C33923547 @default.
• W4386075146 hasConcept C41008148 @default.
• W4386075146 hasConcept C41895202 @default.
• W4386075146 hasConcept C48372109 @default.
• W4386075146 hasConcept C78458016 @default.
• W4386075146 hasConcept C86803240 @default.
• W4386075146 hasConcept C94375191 @default.
• W4386075146 hasConceptScore W4386075146C111919701 @default.
• W4386075146 hasConceptScore W4386075146C11413529 @default.
• W4386075146 hasConceptScore W4386075146C114614502 @default.
• W4386075146 hasConceptScore W4386075146C118505674 @default.
• W4386075146 hasConceptScore W4386075146C138885662 @default.
• W4386075146 hasConceptScore W4386075146C14036430 @default.
• W4386075146 hasConceptScore W4386075146C184720557 @default.
• W4386075146 hasConceptScore W4386075146C2780813799 @default.
• W4386075146 hasConceptScore W4386075146C33923547 @default.
• W4386075146 hasConceptScore W4386075146C41008148 @default.
• W4386075146 hasConceptScore W4386075146C41895202 @default.
• W4386075146 hasConceptScore W4386075146C48372109 @default.
• W4386075146 hasConceptScore W4386075146C78458016 @default.
• W4386075146 hasConceptScore W4386075146C86803240 @default.
• W4386075146 hasConceptScore W4386075146C94375191 @default.
• W4386075146 hasFunder F4320323021 @default.
• W4386075146 hasFunder F4320337504 @default.
• W4386075146 hasLocation W43860751461 @default.
• W4386075146 hasOpenAccess W4386075146 @default.
• W4386075146 hasPrimaryLocation W43860751461 @default.
• W4386075146 hasRelatedWork W2014589784 @default.
• W4386075146 hasRelatedWork W2275988210 @default.
• W4386075146 hasRelatedWork W2374658657 @default.
• W4386075146 hasRelatedWork W2385621972 @default.
• W4386075146 hasRelatedWork W2510680828 @default.
• W4386075146 hasRelatedWork W2589098947 @default.
• W4386075146 hasRelatedWork W2771022762 @default.
• W4386075146 hasRelatedWork W2807289511 @default.
• W4386075146 hasRelatedWork W3204597924 @default.
• W4386075146 hasRelatedWork W4231964008 @default.
• W4386075146 isParatext "false" @default.
• W4386075146 isRetracted "false" @default.
• W4386075146 workType "article" @default.