On the public citation graph
On the construction of statistically synchronizable codes
0 signed · 72 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.1002/j.1538-7305.1959.tb01583.xopenalex-snapshot
Variable-Length Binary Encodings
inferredcites →https://doi.org/10.1016/0890-5401(88)90045-4openalex-snapshot
Mathematical optimization and the synchronizing properties of encodings
inferredcites →https://doi.org/10.1016/s0019-9958(64)90232-3openalex-snapshot
On the synchronizing properties of certain prefix codes
inferredcites →https://doi.org/10.1016/s0019-9958(65)90300-1openalex-snapshot
Codes with bounded synchronization delay
inferredcites →https://doi.org/10.1016/s0019-9958(67)90620-1openalex-snapshot
On synchronizing prefix codes
inferredcites →https://doi.org/10.1049/ep.1969.0319openalex-snapshot
Information Theory and Reliable Communication
inferredcites →https://doi.org/10.1109/18.108260openalex-snapshot
Tight bounds on the redundancy of Huffman codes
inferredcites →https://doi.org/10.1109/18.335933openalex-snapshot
Binary prefix codes ending in a "1"
inferredcites →https://doi.org/10.1109/18.59940openalex-snapshot
Optimum '1'-ended binary prefix codes
inferredcites →https://doi.org/10.1109/18.9779openalex-snapshot
On the characterization of statistically synchronizable variable-length codes
inferredcites →https://doi.org/10.1109/jrproc.1952.273898openalex-snapshot
A Method for the Construction of Minimum-Redundancy Codes
inferredcites →https://doi.org/10.1109/tcom.1972.1091273openalex-snapshot
Theory of Synchronous Communications
inferredcites →https://doi.org/10.1109/tit.1956.1056809openalex-snapshot
On an application of semi groups methods to some problems in coding
inferredcites →https://doi.org/10.1109/tit.1960.1057587openalex-snapshot
Synchronization of binary messages
inferredcites →https://doi.org/10.1109/tit.1962.1057729openalex-snapshot
Efficient error-limiting variable-length codes
inferredcites →https://doi.org/10.1109/tit.1970.1054486openalex-snapshot
Block codes for statistical synchronization
inferredcites →https://doi.org/10.1109/tit.1970.1054490openalex-snapshot
Mechanization of codes with bounded synchronization delays
inferredcites →https://doi.org/10.1109/tit.1971.1054657openalex-snapshot
Construction of minimum-redundance codes with an optimum synchronizing property
inferredcites →https://doi.org/10.1109/tit.1978.1055959openalex-snapshot
Variations on a theme by Huffman
inferredcites →https://doi.org/10.1109/tit.1980.1056266openalex-snapshot
On the characterization of statistically synchronizable codes (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1984.1056931openalex-snapshot
Self-synchronizing Huffman codes (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1985.1057110openalex-snapshot
Error recovery for variable length codes
inferredcites →https://doi.org/10.1109/tit.1986.1057238openalex-snapshot
Synchronization of binary source codes (Corresp.)
inferredcites →https://doi.org/10.2307/2344305openalex-snapshot
Information Theory and Reliable Communication.
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-1-4615-3596-6_8openalex-snapshot
Variations on a Theme by Gallager
inferred← citeshttps://doi.org/10.1007/978-1-84628-959-0openalex-snapshot
Variable-length Codes for Data Compression
inferred← citeshttps://doi.org/10.1007/978-3-031-82014-4_7openalex-snapshot
Old and New Results on Alphabetic Codes
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_9openalex-snapshot
Shortest Synchronizing Strings for Huffman Codes
inferred← citeshttps://doi.org/10.1007/s10959-009-0264-0openalex-snapshot
Variable-Length Coding of Two-sided Asymptotically Mean Stationary Measures
inferred← citeshttps://doi.org/10.1016/b978-0-08-091854-9.50013-0openalex-snapshot
Subband and Wavelet Filters for High-Definition Video Compression**Based on “A Filter Based Bit Allocation Scheme for Subband Compression of HDTV” by J. W. Woods and T. Naveen which appeared in IEEE Trans. Image Processing, vol 1, pp. 436–440, July 1992. © 1992 IEEE.
inferred← citeshttps://doi.org/10.1016/j.aeue.2012.08.002openalex-snapshot
Infinite anti-uniform sources
inferred← citeshttps://doi.org/10.1016/j.dam.2007.06.020openalex-snapshot
T-shift synchronization codes
inferred← citeshttps://doi.org/10.1016/j.endm.2005.07.007openalex-snapshot
T-shift synchronization codes
inferred← citeshttps://doi.org/10.1016/j.image.2005.03.014openalex-snapshot
A multi-resolution, geometry-driven error concealment method for corrupted JPEG color images
inferred← citeshttps://doi.org/10.1016/j.image.2007.05.001openalex-snapshot
A robust joint source channel coding scheme for image transmission over the ionospheric channel
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.06.005openalex-snapshot
Shortest synchronizing strings for Huffman codes
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00268-4openalex-snapshot
Synchronizing codewords of q-ary Huffman codes
inferred← citeshttps://doi.org/10.1080/00207160410001715285openalex-snapshot
Optimal synchronous coding
inferred← citeshttps://doi.org/10.1109/18.335933openalex-snapshot
Binary prefix codes ending in a "1"
inferred← citeshttps://doi.org/10.1109/18.490560openalex-snapshot
Extended synchronizing codewords for binary prefix codes
inferred← citeshttps://doi.org/10.1109/18.651064openalex-snapshot
Binary Huffman equivalent codes with a short synchronizing codeword
inferred← citeshttps://doi.org/10.1109/18.850708openalex-snapshot
A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes
inferred← citeshttps://doi.org/10.1109/18.971750openalex-snapshot
Synchronization recovery of variable-length codes
inferred← citeshttps://doi.org/10.1109/83.382489openalex-snapshot
An error concealment algorithm for images subject to channel errors
inferred← citeshttps://doi.org/10.1109/comst.2000.5340717openalex-snapshot
Error control and concealment for image transmission
inferred← citeshttps://doi.org/10.1109/dcc.2009.18openalex-snapshot
Guaranteed Synchronization of Huffman Codes with Known Position of Decoder
inferred← citeshttps://doi.org/10.1109/icassp.2000.859250openalex-snapshot
HVLC: error correctable hybrid variable length code for image coding in wireless transmission
inferred← citeshttps://doi.org/10.1109/icip.1996.560612openalex-snapshot
Video transmission technology with effective error protection and tough synchronization for wireless channels
inferred← citeshttps://doi.org/10.1109/icip.2000.899398openalex-snapshot
Construction of error resilient synchronization codeword for variable-length code in image transmission
inferred← citeshttps://doi.org/10.1109/iscas.1999.779940openalex-snapshot
Low-overhead error-resilient bit-plane image coding
inferred← citeshttps://doi.org/10.1109/iscas.2001.922238openalex-snapshot
Error resilient hybrid variable length codec with tough error synchronization for wireless image transmission
inferred← citeshttps://doi.org/10.1109/isit.1993.748531openalex-snapshot
Extended Synchronizing Codewords for Binary Prefix Codes
inferred← citeshttps://doi.org/10.1109/isit.1998.708625openalex-snapshot
A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes
inferred← citeshttps://doi.org/10.1109/isit.2003.1228063openalex-snapshot
Self-synchronization of Huffman codes
inferred← citeshttps://doi.org/10.1109/isit.2008.4595175openalex-snapshot
Error recovery of variable length codes over BSC with arbitrary crossover probability
inferred← citeshttps://doi.org/10.1109/itcc.2003.1197531openalex-snapshot
Shortest synchronizing codewords of a binary Huffman equivalent code
inferred← citeshttps://doi.org/10.1109/itw.2007.4313130openalex-snapshot
On a Conjecture on Error Recovery for Variable Length Codes
inferred← citeshttps://doi.org/10.1109/itw.2008.4578649openalex-snapshot
A word that does not appear in encoded message as a resynchronization marker
inferred← citeshttps://doi.org/10.1109/lcn.2010.5735698openalex-snapshot
Scalable encryption of variable length coded video bit streams
inferred← citeshttps://doi.org/10.1109/sequen.1997.666911openalex-snapshot
Code and parse trees for lossless source encoding
inferred← citeshttps://doi.org/10.1109/tce.2003.1196428openalex-snapshot
A low complexity error recovery technique for wavelet image codecs with inter-subband dependency
inferred← citeshttps://doi.org/10.1109/tcomm.2010.06.080555openalex-snapshot
Error recovery of variable length code over BSC with arbitrary crossover probability
inferred← citeshttps://doi.org/10.1109/tit.2003.815803openalex-snapshot
Almost all complete binary prefix codes have a self-synchronizing string
inferred← citeshttps://doi.org/10.1109/tit.2005.844061openalex-snapshot
Robust Multiplexed Codes for Compression of Heterogeneous Data
inferred← citeshttps://doi.org/10.1109/tit.2008.2008113openalex-snapshot
Data Synchronization With Timing: The Variable-Rate Case
inferred← citeshttps://doi.org/10.1109/tit.2009.2013050openalex-snapshot
The Construction of Variable Length Codes With Good Synchronization Properties
inferred← citeshttps://doi.org/10.1504/ijahuc.2012.045541openalex-snapshot
The construction of binary Huffman equivalent codes with a greater number of synchronising codewords
inferred← citeshttps://doi.org/10.3390/e16105575openalex-snapshot
Partial Encryption of Entropy-Coded Video Compression Using Coupled Chaotic Maps
inferred← citeshttps://doi.org/10.47893/ijcct.2010.1007openalex-snapshot
Precise Descriptions of VLC Synchronization with CSP Semantic Models
inferred← citeshttps://doi.org/10.7907/6f03-mp11openalex-snapshot
Interval modulation: a new paradigm for the design of high speed optical communication systems
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.