On the public citation graph

Counteracting malicious adversaries via secret and reliable coding mechanism in random network coding

0 signed · 33 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/s12190-008-0192-7openalex-snapshot
Some properties of submatrices in a solution to the matrix equations AX=C, XB=D
inferredcites →https://doi.org/10.1109/18.850663openalex-snapshot
Network information flow
inferredcites →https://doi.org/10.1109/icc.2008.336openalex-snapshot
Lightweight Security for Network Coding
inferredcites →https://doi.org/10.1109/infcom.2010.5462050openalex-snapshot
P-Coding: Secure Network Coding against Eavesdropping Attacks
inferredcites →https://doi.org/10.1109/isit.2007.4557098openalex-snapshot
On Wiretap Networks II
inferredcites →https://doi.org/10.1109/isit.2008.4594970openalex-snapshot
Adversarial models and resilient schemes for network coding
inferredcites →https://doi.org/10.1109/isit.2008.4594971openalex-snapshot
Security for wiretap networks via rank-metric codes
inferredcites →https://doi.org/10.1109/isit.2010.5513776openalex-snapshot
Universal secure error-correcting schemes for network coding
inferredcites →https://doi.org/10.1109/netcod.2009.5191401openalex-snapshot
Secure error-correcting (SEC) network codes
inferredcites →https://doi.org/10.1109/netcod.2010.5487669openalex-snapshot
Network Codes Resilient to Jamming and Eavesdropping
inferredcites →https://doi.org/10.1109/tcomm.2005.857148openalex-snapshot
Minimum-Energy Multicast in Mobile Ad Hoc Networks Using Network Coding
inferredcites →https://doi.org/10.1109/tit.2002.807285openalex-snapshot
Linear network coding
inferredcites →https://doi.org/10.1109/tit.2006.874532openalex-snapshot
Algebraic gossip: a network coding approach to optimal multiple rumor mongering
inferredcites →https://doi.org/10.1109/tit.2008.921711openalex-snapshot
Resilient Network Coding in the Presence of Byzantine Adversaries
inferredcites →https://doi.org/10.1109/tit.2008.926449openalex-snapshot
Coding for Errors and Erasures in Random Network Coding
inferredcites →https://doi.org/10.1109/tit.2008.928291openalex-snapshot
A Rank-Metric Approach to Error Control in Random Network Coding
inferredcites →https://doi.org/10.1109/tit.2010.2090212openalex-snapshot
Universal Secure Network Coding via Rank-Metric Codes
inferredcites →https://doi.org/10.1155/2010/216524openalex-snapshot
Secure Network Coding against Wiretapping and Byzantine Attacks
inferredcites →https://doi.org/10.1155/2010/403936openalex-snapshot
Superimposed Training-Based Joint CFO and Channel Estimation for CP-OFDM Modulated Two-Way Relay Networks
inferredcites →https://doi.org/10.1587/transfun.e93.a.2026openalex-snapshot
Vulnerability of MRD-Code-based Universal Secure Network Coding against Stronger Eavesdroppers
inferredcites →https://doi.org/10.48550/arxiv.1001.3714openalex-snapshot
Network Codes Resilient to Jamming and Eavesdropping

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/dac.2507openalex-snapshot
A framework of data caching for improving decoding efficiency of opportunistic network coding
inferred← citeshttps://doi.org/10.1002/dac.2565openalex-snapshot
An enhanced XOR‐based scheme for wireless packet retransmission problem
inferred← citeshttps://doi.org/10.1002/dac.2763openalex-snapshot
Combining network coding and compressed sensing for error correction in wireless sensor networks
inferred← citeshttps://doi.org/10.1002/dac.2765openalex-snapshot
Energy efficiency based on joint mobile node grouping and data packet fragmentation in short‐range communication system
inferred← citeshttps://doi.org/10.1002/dac.2781openalex-snapshot
Network coding based on hyper‐edge decomposition for wireless network with link failures
inferred← citeshttps://doi.org/10.1002/dac.3013openalex-snapshot
Improving reliability of erasure codes‐based storage paradigm under correlated failures for wireless sensor networks
inferred← citeshttps://doi.org/10.1002/dac.3526openalex-snapshot
On the optimal flow allocation and information theoretically secure network coding design for multiple multicasts
inferred← citeshttps://doi.org/10.1007/s11277-012-0666-7openalex-snapshot
Secret Error Control Codes Against Malicious Attacks in Random Multisource Network Coding
inferred← citeshttps://doi.org/10.1016/j.comnet.2018.03.013openalex-snapshot
Security against passive attacks on network coding system – A survey
inferred← citeshttps://doi.org/10.1109/iccsn.2011.6014609openalex-snapshot
Secret and reliable coding mechanism for noncoherent multisource network coding
inferred← citeshttps://doi.org/10.4103/0377-2063.126975openalex-snapshot
Auction-based bandwidth management with network coding and cooperative communication in wireless networks
inferred← citeshttps://doi.org/10.5121/ijcnc.2013.5604openalex-snapshot
The Improvement of End to End Delays in Network Management System using Network coding
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.