Results 21 to 30 of about 6,168,782 (115)
Coding for Wireless Broadcast and Network Secrecy [PDF]
, 2010 In the first part of this thesis, we exploit wireless broadcast across different layers in wireless networks. The wireless channel is distinguished by its broadcast nature.
Cui, Tao
core +1 more source
Entropy Region and Network Information Theory [PDF]
, 2011 This dissertation takes a step toward a general framework for solving network information theory problems by studying the capacity region of networks through the entropy region.
Sormeh Shadbakht, Shadbakht, Sormeh
core +1 more source
Earth and Space Science, Volume 13, Issue 8, August 2026.Abstract The planetary boundary layer (PBL) is the portion of the troposphere that is directly influenced by the presence of the Earth's surface. The thermodynamic structure of this layer exhibits a wide variety of characteristics across the globe. In 2018 the National Academies of Sciences, Engineering, and Medicine Space Studies Board recommended ...
M. L. Loveless +3 more
wiley +1 more source
Journal of Applied Crystallography, Volume 59, Issue 4, Page 1170-1183, August 2026.We present a model‐independent approach based on the Shannon sampling theorem to retrieve key structural parameters of proteins and core–shell micelles directly from small‐angle X‐ray scattering (SAXS) profiles. By bypassing the pair distribution function, the method overcomes q‐truncation artifacts and provides reliable mass, size and aggregation ...
Liberato De Caro +7 more
wiley +1 more source
Graph-Based Codes and Iterative Decoding [PDF]
, 2003 The field of error correcting codes was revolutionized by the introduction of turbo codes in 1993. These codes demonstrated dramatic performance improvements over any previously known codes, with significantly lower complexity.
Khandekar, Aamod Dinkar
core +1 more source
How to see the forest despite the trees
Journal of the London Mathematical Society, Volume 114, Issue 2, August 2026.Abstract One of the major starting points of discrete optimization is the theorem of Nash‐Williams and Tutte on the existence of k$k$ disjoint spanning trees of a graph, along with its counterpart on the existence of k$k$ forests covering all edges of the graph.
Erika Bérczi‐Kovács, András Frank
wiley +1 more source
Some theorems on noiseless coding [PDF]
, 1976 For a generalized random variable X, a measure L¯X of average code length is defined. Using L¯X, some coding theorems for discrete noiseless channels are proved.
Nath, Prem
core +1 more source
Graph Model‐Based Edge Node Pilot Attack Tracing Technology of Power Terminal Embedded Components
Engineering Reports, Volume 8, Issue 6, June 2026.A graph model‐based pilot attack‐tracing method for power terminal embedded components is proposed, integrating dynamic trust adjustment with random‐walk graph embedding. The approach achieves high detection probability (0.999 at 400 iterations) and robust anti‐attack capability (≥ 0.97) while maintaining < 2.0% packet loss, enabling efficient edge ...
Peng Xiao, Jian Hu, Li Liu
wiley +1 more source
Graph Guessing Games and Non-Shannon Information Inequalities [PDF]
, 2016 Guessing games for directed graphs were introduced by Riis [12] for studying multiple unicast network coding problems. In a guessing game, the players toss generalised dice and can see some of the other outcomes depending on the structure of an ...
Vaughan, ER +9 more
core +1 more source
Information Flow in Geophysical Systems
Journal of Advances in Modeling Earth Systems, Volume 18, Issue 6, June 2026.Abstract We present a new framework for analyzing the evolution of information in geophysical systems. Understanding how information, and its counterpart, uncertainty, propagates is central to predictability studies and has significant implications for applications such as forecast uncertainty quantification and risk management. It also offers valuable
P. J. van Leeuwen
wiley +1 more source