On the public citation graph
Watermarking Identification Codes with Related Topics on Common Randomness
0 signed · 58 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.1007/978-1-4419-8608-5openalex-snapshot
A First Course in Information Theory
inferredcites →https://doi.org/10.1007/978-1-4757-6048-4_15openalex-snapshot
The AVC with Noiseless Feedback and Maximal Error Probability: A Capacity Formula with a Trichotomy
inferredcites →https://doi.org/10.1007/bf00533053openalex-snapshot
Elimination of correlation in random codes for arbitrarily varying channels
inferredcites →https://doi.org/10.1007/bf00535895openalex-snapshot
Channels with arbitrarily varying channel probability functions in the presence of noiseless feedback
inferredcites →https://doi.org/10.1016/j.dam.2007.07.007openalex-snapshot
General theory of information transfer: Updated
inferredcites →https://doi.org/10.1016/j.endm.2005.07.019openalex-snapshot
General theory of information transfer
inferredcites →https://doi.org/10.1016/s0890-5401(03)00056-7openalex-snapshot
On identification secret sharing schemes
inferredcites →https://doi.org/10.1109/18.108245openalex-snapshot
New results in the theory of identification via channels
inferredcites →https://doi.org/10.1109/18.243431openalex-snapshot
Common randomness in information theory and cryptography. I. Secret sharing
inferredcites →https://doi.org/10.1109/18.256484openalex-snapshot
Secret key agreement by public discussion from common information
inferredcites →https://doi.org/10.1109/18.391249openalex-snapshot
New directions in the theory of identification via channels
inferredcites →https://doi.org/10.1109/18.42173openalex-snapshot
Identification in the presence of feedback-a discovery of new capacity formulas
inferredcites →https://doi.org/10.1109/18.651022openalex-snapshot
The common randomness capacity of a pair of independent discrete memoryless channels
inferredcites →https://doi.org/10.1109/18.651026openalex-snapshot
Common randomness in information theory and cryptography. II. CR capacity
inferredcites →https://doi.org/10.1109/18.661504openalex-snapshot
Information and control: matching channels
inferredcites →https://doi.org/10.1109/18.669139openalex-snapshot
New converses in the theory of identification via channels
inferredcites →https://doi.org/10.1109/18.825796openalex-snapshot
Common randomness and secret key generation with a helper
inferredcites →https://doi.org/10.1109/18.825797openalex-snapshot
The common randomness capacity of a network of discrete memoryless channels
inferredcites →https://doi.org/10.1109/18.825801openalex-snapshot
On random coding error exponents of watermarking systems
inferredcites →https://doi.org/10.1109/18.887853openalex-snapshot
On identification capacity of infinite alphabets or continuous-time channels
inferredcites →https://doi.org/10.1109/18.923724openalex-snapshot
Identification in the presence of side information with application to watermarking
inferredcites →https://doi.org/10.1109/5.771068openalex-snapshot
Watermarking as communications with side information
inferredcites →https://doi.org/10.1109/icip.1998.723521openalex-snapshot
Capacity issues in digital image watermarking
inferredcites →https://doi.org/10.1109/isit.1998.708902openalex-snapshot
Information theoretic analysis of steganography
inferredcites →https://doi.org/10.1109/tit.1975.1055469openalex-snapshot
Source coding with side information and a converse for degraded broadcast channels
inferredcites →https://doi.org/10.1109/tit.2002.808134openalex-snapshot
Information-theoretic analysis of information hiding
inferredcites →https://doi.org/10.1117/12.344694openalex-snapshot
Capacity of the watermark channel: how many bits can be hidden within a digital image?
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-65072-8_16openalex-snapshot
Watermarking Identification Codes with Related Topics on Common Randomness
inferred← citeshttps://doi.org/10.1007/978-3-031-82014-4_15openalex-snapshot
Secure Identification for Multi-antenna Gaussian Channels
inferred← citeshttps://doi.org/10.1007/978-3-031-82014-4_19openalex-snapshot
Ning Cai: A Tribute to a Pioneering Scholar in Information Theory
inferred← citeshttps://doi.org/10.1007/s11128-023-04107-wopenalex-snapshot
Identification over quantum broadcast channels
inferred← citeshttps://doi.org/10.1109/globecom52923.2024.10901480openalex-snapshot
An Achievable Rate-Distortion Region of Joint Identification and Sensing for Multiple Access Channels
inferred← citeshttps://doi.org/10.1109/icc42927.2021.9500406openalex-snapshot
Deterministic Identification Over Channels With Power Constraints
inferred← citeshttps://doi.org/10.1109/icc45855.2022.9838478openalex-snapshot
Identification over Compound MIMO Broadcast Channels
inferred← citeshttps://doi.org/10.1109/isit.2017.8006787openalex-snapshot
Robust and secure identification
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9517727openalex-snapshot
Identification over the Gaussian Channel in the Presence of Feedback
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9517972openalex-snapshot
Common Randomness Generation over Slow Fading Channels
inferred← citeshttps://doi.org/10.1109/isit50566.2022.9834514openalex-snapshot
Common Randomness Generation from Gaussian Sources
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206481openalex-snapshot
Deterministic Identification Over Multiple-Access Channels
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206635openalex-snapshot
Joint Identification and Sensing for Discrete Memoryless Channels
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206640openalex-snapshot
A Lower and Upper Bound on the Epsilon-Uniform Common Randomness Capacity
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619546openalex-snapshot
Common Randomness Generation from Finite Compound Sources
inferred← citeshttps://doi.org/10.1109/isit63088.2025.11195591openalex-snapshot
Common Randomness Generation from Sources with Infinite Polish Alphabets
inferred← citeshttps://doi.org/10.1109/itw46852.2021.9457587openalex-snapshot
Deterministic Identification Over Fading Channels
inferred← citeshttps://doi.org/10.1109/itw48936.2021.9611466openalex-snapshot
Outage Common Randomness Capacity Characterization of Multiple-Antenna Slow Fading Channels
inferred← citeshttps://doi.org/10.1109/itw54588.2022.9965912openalex-snapshot
A General Formula for Uniform Common Randomness Capacity
inferred← citeshttps://doi.org/10.1109/itw61385.2024.10806939openalex-snapshot
Identification via Gaussian Multiple Access Channels in the Presence of Feedback
inferred← citeshttps://doi.org/10.1109/tifs.2018.2797004openalex-snapshot
Secure Identification for Wiretap Channels; Robustness, Super-Additivity and Continuity
inferred← citeshttps://doi.org/10.1109/tifs.2018.2854729openalex-snapshot
Secure Identification Under Passive Eavesdroppers and Active Jamming Attacks
inferred← citeshttps://doi.org/10.1109/tit.2019.2920952openalex-snapshot
Secure and Robust Identification via Classical-Quantum Channels
inferred← citeshttps://doi.org/10.1109/tit.2021.3122811openalex-snapshot
Deterministic Identification Over Channels With Power Constraints
inferred← citeshttps://doi.org/10.1109/tit.2023.3259580openalex-snapshot
Identification Over Compound Multiple-Input Multiple-Output Broadcast Channels
inferred← citeshttps://doi.org/10.1109/tit.2025.3565891openalex-snapshot
Uniform Common Randomness Generation Over Arbitrary Point-to-Point Channels
inferred← citeshttps://doi.org/10.1109/tit.2025.3595704openalex-snapshot
Common Randomness Generation From Finite Compound Sources Aided by One-Way Communication
inferred← citeshttps://doi.org/10.17656/jzs.10265openalex-snapshot
Watermarked and Noisy Images identification Based on Statistical Evaluation Parameters
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.