On the public citation graph

Towards Practical Minimum-Entropy Universal Decoding

0 signed · 36 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/978-1-4613-8431-1openalex-snapshot
Lectures on 0/1-Polytopes
inferredcites →https://doi.org/10.1007/978-3-662-03199-5openalex-snapshot
Global Optimization
inferredcites →https://doi.org/10.1109/18.720546openalex-snapshot
The method of types [information theory]
inferredcites →https://doi.org/10.1109/18.910573openalex-snapshot
Codes on graphs: normal realizations
inferredcites →https://doi.org/10.1109/4234.905935openalex-snapshot
On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit
inferredcites →https://doi.org/10.1109/4234.957380openalex-snapshot
Compression of correlated binary sources using turbo codes
inferredcites →https://doi.org/10.1109/dcc.2002.999963openalex-snapshot
Compression with side information using turbo codes
inferredcites →https://doi.org/10.1109/dcc.2003.1194010openalex-snapshot
Distributed compression of binary sources using conventional parallel and serial concatenated convolutional codes
inferredcites →https://doi.org/10.1109/dcc.2004.1281473openalex-snapshot
On some new approaches to practical Slepian-Wolf compression inspired by channel coding
inferredcites →https://doi.org/10.1109/icassp.2005.1416501openalex-snapshot
Towards Bridging the Gap Between Theory and Practice for the Slepian-Wolf Problem
inferredcites →https://doi.org/10.1109/icc.1993.397441openalex-snapshot
Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1
inferredcites →https://doi.org/10.1109/isit.2004.1365106openalex-snapshot
LP decoding corrects a constant fraction of errors
inferredcites →https://doi.org/10.1109/tit.1973.1055037openalex-snapshot
Noiseless coding of correlated information sources
inferredcites →https://doi.org/10.1109/tit.1982.1056524openalex-snapshot
Linear codes for sources and source networks: Error exponents, universal coding
inferredcites →https://doi.org/10.1109/tit.2002.1003853openalex-snapshot
Error exponents of expander codes
inferredcites →https://doi.org/10.1109/tit.2002.800480openalex-snapshot
Random codes: minimum distances and error exponents
inferredcites →https://doi.org/10.1109/tit.2004.842696openalex-snapshot
Using Linear Programming to Decode Binary Linear Codes
inferredcites →https://doi.org/10.1177/027836499701600102openalex-snapshot
On Computing Four-Finger Equilibrium and Force-Closure Grasps of Polyhedral Objects

What points at this work

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

inferred← citeshttps://doi.org/10.1109/cdc.2007.4434962openalex-snapshot
Distributed minimum cost multicasting with lossless source coding and network coding
inferred← citeshttps://doi.org/10.1109/chinacom.2009.5339957openalex-snapshot
A relaxed practical universal decoding algorithm for slepian-wolf system
inferred← citeshttps://doi.org/10.1109/globalsip.2017.8309135openalex-snapshot
Design of binary LDPC codes for Slepian-Wolf coding of correlated information sources
inferred← citeshttps://doi.org/10.1109/icc40277.2020.9149399openalex-snapshot
Neural Network Coding
inferred← citeshttps://doi.org/10.1109/isit.2011.6034160openalex-snapshot
Joint source-network coding for large-scale sensor networks
inferred← citeshttps://doi.org/10.1109/iswcs.2009.5285249openalex-snapshot
Practical source-network decoding
inferred← citeshttps://doi.org/10.1109/itw.2009.5351225openalex-snapshot
Construction of wiretap channel codes by using sparse matrices
inferred← citeshttps://doi.org/10.1109/mobhoc.2007.4428675openalex-snapshot
Opportunistic Source Coding for Data Gathering in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/spawc53906.2023.10304520openalex-snapshot
Distributed Computing of Functions of Structured Sources with Helper Side Information
inferred← citeshttps://doi.org/10.1109/tcomm.2014.2382126openalex-snapshot
Density Evolution for the Design of Non-Binary Low Density Parity Check Codes for Slepian-Wolf Coding
inferred← citeshttps://doi.org/10.1109/tit.2010.2046214openalex-snapshot
Hash Property and Fixed-Rate Universal Coding Theorems
inferred← citeshttps://doi.org/10.1109/tit.2011.2173716openalex-snapshot
Construction of Codes for the Wiretap Channel and the Secret Key Agreement From Correlated Source Outputs Based on the Hash Property
inferred← citeshttps://doi.org/10.1109/tit.2014.2302005openalex-snapshot
Minimum Complexity Pursuit for Universal Compressed Sensing
inferred← citeshttps://doi.org/10.1145/1347787.1347801openalex-snapshot
Opportunistic source coding for data gathering in wireless sensor networks
inferred← citeshttps://doi.org/10.1587/transfun.e92.a.2333openalex-snapshot
A Construction of Channel Code, Joint Source-Channel Code, and Universal Code for Arbitrary Stationary Memoryless Channels Using Sparse Matrices
inferred← citeshttps://doi.org/10.34626/9a9e-gy56openalex-snapshot
Decoder design and decoding models for joint source-network coding
inferred← citeshttps://doi.org/10.48550/arxiv.1111.5735openalex-snapshot
Efficient Joint Network-Source Coding for Multiple Terminals with Side Information
inferred← citeshttps://doi.org/10.48550/arxiv.1208.5814openalex-snapshot
Minimum Complexity Pursuit for Universal Compressed Sensing
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.