On the public citation graph
Finding parity in a simple broadcast network
0 signed · 113 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1049/ep.1969.0319openalex-snapshot
Information Theory and Reliable Communication
inferredcites →https://doi.org/10.1109/tit.1962.1057683openalex-snapshot
Low-density parity-check codes
inferredcites →https://doi.org/10.1109/tit.1964.1053651openalex-snapshot
Review of 'Low-Density Parity-Check Codes' (Gallager, R. G.; 1963)
inferredcites →https://doi.org/10.2307/2344305openalex-snapshot
Information Theory and Reliable Communication.
inferredcites →https://doi.org/10.7551/mitpress/4347.001.0001openalex-snapshot
Low-Density Parity-Check Codes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rsa.20240openalex-snapshot
Computing in fault tolerant broadcast networks and noisy decision trees
inferred← citeshttps://doi.org/10.1007/978-0-387-68845-9_4openalex-snapshot
Function Computation in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-031-21975-7_5openalex-snapshot
Hardware-Limited Task-Based Quantization in Systems
inferred← citeshttps://doi.org/10.1007/s00446-017-0303-5openalex-snapshot
Reliable Communication over Highly Connected Noisy Networks
inferred← citeshttps://doi.org/10.1016/j.adhoc.2012.02.016openalex-snapshot
Internet of things: Vision, applications and research challenges
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00002-8openalex-snapshot
Finding OR in a noisy broadcast network
inferred← citeshttps://doi.org/10.1017/9781108616799.016openalex-snapshot
Network Functional Compression
inferred← citeshttps://doi.org/10.1080/03081079.2012.708342openalex-snapshot
Worst-case asymmetric distributed function computation
inferred← citeshttps://doi.org/10.1109/18.556671openalex-snapshot
Coding for interactive communication
inferred← citeshttps://doi.org/10.1109/18.748992openalex-snapshot
Good error-correcting codes based on very sparse matrices
inferred← citeshttps://doi.org/10.1109/access.2017.2715182openalex-snapshot
Design and Analysis of In-Network Computation Protocols With Compressive Sensing in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/allerton.2008.4797527openalex-snapshot
Network coding for computing
inferred← citeshttps://doi.org/10.1109/allerton.2008.4797597openalex-snapshot
On the delay performance of in-network aggregation in lossy wireless sensor networks
inferred← citeshttps://doi.org/10.1109/allerton.2008.4797694openalex-snapshot
Finding the K largest metrics in a noisy broadcast network
inferred← citeshttps://doi.org/10.1109/allerton.2009.5394930openalex-snapshot
Distributed function computation in asymmetric communication scenarios
inferred← citeshttps://doi.org/10.1109/allerton.2013.6736711openalex-snapshot
On the capacity of sum-networks
inferred← citeshttps://doi.org/10.1109/allerton.2014.7028441openalex-snapshot
Information friction limits on computation
inferred← citeshttps://doi.org/10.1109/ccc.2004.1313813openalex-snapshot
Computing in fault tolerance broadcast networks
inferred← citeshttps://doi.org/10.1109/ccc.2004.8openalex-snapshot
Computing in fault tolerance broadcast networks
inferred← citeshttps://doi.org/10.1109/cdc.2008.4739490openalex-snapshot
Distributed computation under bit constraints
inferred← citeshttps://doi.org/10.1109/ciss.2011.5766238openalex-snapshot
Distributed opinion estimation using iterative majority voting
inferred← citeshttps://doi.org/10.1109/ciss.2013.6624265openalex-snapshot
A Network Flow Approach in Cloud Computing
inferred← citeshttps://doi.org/10.1109/focs.2008.72openalex-snapshot
Lower Bounds for Noisy Wireless Networks using Sampling Algorithms
inferred← citeshttps://doi.org/10.1109/focs.2019.00030openalex-snapshot
Radio Network Coding Requires Logarithmic Overhead
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00068openalex-snapshot
Tight Bounds for General Computation in Noisy Broadcast Networks
inferred← citeshttps://doi.org/10.1109/glocom.2011.6133878openalex-snapshot
Efficient Flow Allocation Algorithms for In-Network Function Computation
inferred← citeshttps://doi.org/10.1109/infcom.2007.262openalex-snapshot
Joint Optimal Channel Probing and Transmission in Collocated Wireless Networks
inferred← citeshttps://doi.org/10.1109/infcom.2010.5462023openalex-snapshot
Towards Efficient Designs for In-network Computing with Noisy Wireless Channels
inferred← citeshttps://doi.org/10.1109/infocom41043.2020.9155442openalex-snapshot
How to Distribute Computation in Networks
inferred← citeshttps://doi.org/10.1109/isit.2007.4557101openalex-snapshot
On Distributed Computation in Noisy Random Planar Networks
inferred← citeshttps://doi.org/10.1109/isit.2007.4557216openalex-snapshot
Scaling Bounds for Function Computation over Large Networks
inferred← citeshttps://doi.org/10.1109/isit.2008.4595066openalex-snapshot
On distributed function computation in structure-free random networks
inferred← citeshttps://doi.org/10.1109/isit.2009.5205921openalex-snapshot
Feasible alphabets for communicating the sum of sources over a network
inferred← citeshttps://doi.org/10.1109/isit.2009.5205926openalex-snapshot
Information-theoretic bounds for multiround function computation in collocated networks
inferred← citeshttps://doi.org/10.1109/isit.2010.5513428openalex-snapshot
Infinite-message interactive function computation in collocated networks
inferred← citeshttps://doi.org/10.1109/isit.2010.5513430openalex-snapshot
A necessary and sufficient condition for solvability of a 3s/3t sum-network
inferred← citeshttps://doi.org/10.1109/isit.2011.6033983openalex-snapshot
Network flows for functions
inferred← citeshttps://doi.org/10.1109/isit.2015.7282881openalex-snapshot
Converses for distributed estimation via strong data processing inequalities
inferred← citeshttps://doi.org/10.1109/isit.2016.7541796openalex-snapshot
Energy efficient distributed coding for data collection in a noisy sparse network
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619253openalex-snapshot
Computation in Server-Assisted Noisy Networks
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619523openalex-snapshot
Information Exchange is Harder with Noise at Source
inferred← citeshttps://doi.org/10.1109/itw.2013.6691269openalex-snapshot
On the capacity of ms/3t and 3s/nt sum-networks
inferred← citeshttps://doi.org/10.1109/itw48936.2021.9611505openalex-snapshot
Multiparty Interactive Communication with Broadcast Links
inferred← citeshttps://doi.org/10.1109/itwksps.2010.5503143openalex-snapshot
Some bounds on the capacity of communicating the sum of sources
inferred← citeshttps://doi.org/10.1109/itwnit.2009.5158545openalex-snapshot
Distributed computation of symmetric functions with binary inputs
inferred← citeshttps://doi.org/10.1109/jiot.2025.3579940openalex-snapshot
AI-Enabled Integrated Sensing, Communication, and Computation Survey: Techniques, Status, and Perspectives
inferred← citeshttps://doi.org/10.1109/jproc.2010.2065790openalex-snapshot
Fundamentals of Large Sensor Networks: Connectivity, Capacity, Clocks, and Computation
inferred← citeshttps://doi.org/10.1109/jproc.2012.2189792openalex-snapshot
Cyber–Physical Systems: A Perspective at the Centennial
inferred← citeshttps://doi.org/10.1109/jsac.2013.130407openalex-snapshot
Distributed Function Computation with Confidentiality
inferred← citeshttps://doi.org/10.1109/jsac.2013.130409openalex-snapshot
Network Flows for Function Computation
inferred← citeshttps://doi.org/10.1109/jsac.2013.130410openalex-snapshot
Computing Statistical Functions in Wired Networks
inferred← citeshttps://doi.org/10.1109/jsait.2021.3101762openalex-snapshot
Function Load Balancing Over Networks
inferred← citeshttps://doi.org/10.1109/jsait.2021.3126422openalex-snapshot
Multiparty Interactive Coding Over Networks of Intersecting Broadcast Links
inferred← citeshttps://doi.org/10.1109/mcom.2006.1632656openalex-snapshot
Toward a theory of in-network computation in wireless sensor networks
inferred← citeshttps://doi.org/10.1109/mcom.2016.7565182openalex-snapshot
The three primary colors of mobile systems
inferred← citeshttps://doi.org/10.1109/netcod.2009.5191400openalex-snapshot
Some results on communicating the sum of sources over a network
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267778openalex-snapshot
Communication on noisy channels: a coding theorem for computation
inferred← citeshttps://doi.org/10.1109/sfcs.2005.48openalex-snapshot
Lower Bounds for the Noisy Broadcast Problem
inferred← citeshttps://doi.org/10.1109/srds.2006.40openalex-snapshot
Reliably Executing Tasks in the Presence of Untrusted Entities
inferred← citeshttps://doi.org/10.1109/tit.2006.880029openalex-snapshot
Achievable Rates and Scaling Laws of Power-Constrained Wireless Sensory Relay Networks
inferred← citeshttps://doi.org/10.1109/tit.2007.909156openalex-snapshot
Distributed Symmetric Function Computation in Noisy Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/tit.2010.2080850openalex-snapshot
Information Theoretic Bounds for Distributed Computation Over Networks of Point-to-Point Channels
inferred← citeshttps://doi.org/10.1109/tit.2010.2095070openalex-snapshot
Network Coding for Computing: Cut-Set Bounds
inferred← citeshttps://doi.org/10.1109/tit.2011.2165807openalex-snapshot
When Is a Function Securely Computable?
inferred← citeshttps://doi.org/10.1109/tit.2011.2168902openalex-snapshot
Time and Energy Complexity of Function Computation Over Networks
inferred← citeshttps://doi.org/10.1109/tit.2011.2169532openalex-snapshot
On Network Coding for Sum-Networks
inferred← citeshttps://doi.org/10.1109/tit.2012.2188883openalex-snapshot
Optimal Function Computation in Directed and Undirected Graphs
inferred← citeshttps://doi.org/10.1109/tit.2012.2192094openalex-snapshot
Interactive Source Coding for Function Computation in Collocated Networks
inferred← citeshttps://doi.org/10.1109/tit.2013.2293214openalex-snapshot
On Distributed Function Computation in Structure-Free Random Wireless Networks
inferred← citeshttps://doi.org/10.1109/tit.2013.2294186openalex-snapshot
Efficient Coding for Interactive Communication
inferred← citeshttps://doi.org/10.1109/tit.2014.2332464openalex-snapshot
On Network Functional Compression
inferred← citeshttps://doi.org/10.1109/tit.2017.2664813openalex-snapshot
Information-Theoretic Lower Bounds for Distributed Function Computation
inferred← citeshttps://doi.org/10.1109/tit.2017.2725267openalex-snapshot
Graph Codes for Distributed Instant Message Collection in an Arbitrary Noisy Broadcast Network
inferred← citeshttps://doi.org/10.1109/tit.2019.2904576openalex-snapshot
Constant-Rate Interactive Coding Is Impossible, Even in Constant-Degree Networks
inferred← citeshttps://doi.org/10.1109/tmc.2010.59openalex-snapshot
In-Network Computation in Random Wireless Networks: A PAC Approach to Constant Refresh Rates with Lower Energy Costs
inferred← citeshttps://doi.org/10.1109/tmc.2012.185openalex-snapshot
Efficient In-Network Computing with Noisy Wireless Channels
inferred← citeshttps://doi.org/10.1109/tnet.2013.2256795openalex-snapshot
On the Delay Performance of In-Network Aggregation in Lossy Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/tnet.2015.2445835openalex-snapshot
Optimal Embedding of Functions for In-Network Computation: Complexity Analysis and Algorithms
inferred← citeshttps://doi.org/10.1109/tsp.2023.3238888openalex-snapshot
A Distributed Computationally Aware Quantizer Design via Hyper Binning
inferred← citeshttps://doi.org/10.1109/wcnc.2015.7127790openalex-snapshot
Fast arbitrary function computation over a wireless network: A linear programming
inferred← citeshttps://doi.org/10.1109/wiopt.2006.1666455openalex-snapshot
Distributed Symmetric Function Computation in Noisy Wireless Sensor Networks with Binary Data
inferred← citeshttps://doi.org/10.1109/wiopt.2011.5930069openalex-snapshot
Distributed function computation in networks: A joint delay-energy perspective
inferred← citeshttps://doi.org/10.1137/060654864openalex-snapshot
Lower Bounds for the Noisy Broadcast Problem
inferred← citeshttps://doi.org/10.1137/1.9781611975994.131openalex-snapshot
Instance-Optimality in the Noisy Value-and Comparison-Model
inferred← citeshttps://doi.org/10.1137/s0895480103434063openalex-snapshot
Computation in Noisy Radio Networks
inferred← citeshttps://doi.org/10.1142/s0129626412500028openalex-snapshot
RELIABLE INTERNET-BASED MASTER-WORKER COMPUTING IN THE PRESENCE OF MALICIOUS WORKERS
inferred← citeshttps://doi.org/10.1145/195058.195462openalex-snapshot
A coding theorem for distributed computation
inferred← citeshttps://doi.org/10.1145/2213977.2214044openalex-snapshot
Making polynomials robust to noise
inferred← citeshttps://doi.org/10.1145/2897518.2897563openalex-snapshot
Constant-Rate Coding for Multiparty Interactive Communication Is Impossible
inferred← citeshttps://doi.org/10.1145/3087801.3087808openalex-snapshot
Broadcasting in Noisy Radio Networks
inferred← citeshttps://doi.org/10.1145/3382734.3405705openalex-snapshot
Brief Announcement: Noisy Beeping Networks
inferred← citeshttps://doi.org/10.1561/0400000079openalex-snapshot
Coding for Interactive Communication: A Survey
inferred← citeshttps://doi.org/10.23919/fusion43075.2019.9011353openalex-snapshot
Distributed Learning over Time-Varying Graphs with Adversarial Agents
inferred← citeshttps://doi.org/10.4230/lipics.disc.2019.10openalex-snapshot
Erasure Correction for Noisy Radio Networks
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2018.49openalex-snapshot
Limits for Rumor Spreading in Stochastic Populations
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2020.42openalex-snapshot
Consensus Needs Broadcast in Noiseless Models but can be Exponentially Easier in the Presence of Noise
inferred← citeshttps://doi.org/10.48550/arxiv.1001.4137openalex-snapshot
On the solvability of 3-source 3-terminal sum-networks
inferred← citeshttps://doi.org/10.48550/arxiv.1502.02290openalex-snapshot
How Hard is Computing Parity with Noisy Communications?
inferred← citeshttps://doi.org/10.48550/arxiv.1806.08182openalex-snapshot
Instance-Optimality in the Noisy Value-and Comparison-Model --- Accept, Accept, Strong Accept: Which Papers get in?
inferred← citeshttps://doi.org/10.48550/arxiv.1808.00838openalex-snapshot
Algorithms for Noisy Broadcast under Erasures
inferred← citeshttps://doi.org/10.5555/1070432.1070520openalex-snapshot
Rounds vs queries trade-off in noisy computation
inferred← citeshttps://doi.org/10.5555/314613.314709openalex-snapshot
Computation in noisy radio networks
inferred← citeshttps://doi.org/10.70675/807c9df9z503fz4f71z8c2czcbc795c262efopenalex-snapshot
Search and broadcast in stochastic environments, a biological perspective
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.