Results 41 to 50 of about 546,736 (277)
Linear-Complexity Overhead-Optimized Random Linear Network Codes
, 2013 Sparse random linear network coding (SRLNC) is an attractive technique proposed in the literature to reduce the decoding complexity of random linear network coding. Recognizing the fact that the existing SRLNC schemes are not efficient in terms of the required reception overhead, we consider the problem of designing overhead-optimized SRLNC schemes. To
Mahdaviani, Kaveh +2 more
openaire +2 more sources
A Linear Network Code Construction for General Integer Connections Based on the Constraint Satisfaction Problem [PDF]
, 2015 The problem of finding network codes for general connections is inherently difficult in capacity constrained networks. Resource minimization for general connections with network coding is further complicated.
Cui, Ying +6 more
core +2 more sources
On GRAND-Assisted Vector Random Linear Network Coding in Wireless Broadcasts
EntropyRecent works have combined random linear network coding (RLNC) with guessing random additive noise decoding (GRAND) to leverage RLNC packets to partially correct bit errors prior to RLNC decoding, so as to reduce the packet erasure rates in wireless ...
Rina Su +3 more
doaj +1 more source
Passive network tomography for erroneous networks: A network coding approach
, 2010 Passive network tomography uses end-to-end observations of network communication to characterize the network, for instance to estimate the network topology and to localize random or adversarial glitches.
Chen, Minghua +2 more
core +2 more sources
Sparse Regression Codes for Multi-terminal Source and Channel Coding [PDF]
, 2012 We study a new class of codes for Gaussian multi-terminal source and channel coding. These codes are designed using the statistical framework of high-dimensional linear regression and are called Sparse Superposition or Sparse Regression codes.
Tatikonda, Sekhar, Venkataramanan, Ramji
core +1 more source
International Journal of Distributed Sensor Networks, 2012 Network coding (NC) can be applied to achieve the maximal information flow in a network. In energy-constraint wireless networks such as wireless sensor networks, applying NC can further reduce the number of wireless transmissions and hence prolong the ...
Jen-Yeu Chen, Yi-Ying Tseng
doaj +1 more source
MATIN: a random network coding based framework for high quality peer-to-peer live video streaming. [PDF]
PLoS ONE, 2013 In recent years, Random Network Coding (RNC) has emerged as a promising solution for efficient Peer-to-Peer (P2P) video multicasting over the Internet. This probably refers to this fact that RNC noticeably increases the error resiliency and throughput of
Behrang Barekatain +7 more
doaj +1 more source
On practical design for joint distributed source and network coding [PDF]
, 2009 This paper considers the problem of communicating correlated information from multiple source nodes over a network of noiseless channels to multiple destination nodes, where each destination node wants to recover all sources. The problem involves a joint
Kung, S. +3 more
core +1 more source
Cell wall target fragment discovery using a low‐cost, minimal fragment library
FEBS Letters, EarlyView.LoCoFrag100 is a fragment library made up of 100 different compounds. Similarity between the fragments is minimized and 10 different fragments are mixed into a single cocktail, which is soaked to protein crystals. These crystals are analysed by X‐ray crystallography, revealing the binding modes of the bound fragment ligands.
Kaizhou Yan +5 more
wiley +1 more source
On achievable rates for multicast in the presence of side information [PDF]
, 2008 We investigate the network source coding rate region for networks with multiple sources and multicast demands in the presence of side information, generalizing earlier results on multicast rate regions without side information.
Bakshi, Mayank, Effros, Michelle
core +1 more source