On the public citation graph

Hamming distance preserving mappings and trellis codes with constrained binary symbols

0 signed · 51 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.1002/j.1538-7305.1986.tb00373.xopenalex-snapshot
Half Weight Block Codes for Optical Communications
inferredcites →https://doi.org/10.1016/s0019-9958(70)90369-4openalex-snapshot
Block codes for a class of constrained noiseless channels
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1080/00207218308961573openalex-snapshot
Invited paper Principles of digital line coding
inferredcites →https://doi.org/10.1109/tit.1980.1056141openalex-snapshot
Lower bounds for constant weight codes
inferredcites →https://doi.org/10.1109/tit.1983.1056597openalex-snapshot
Algorithms for sliding block codes - An application of symbolic dynamics to information theory
inferredcites →https://doi.org/10.1109/tit.1986.1057125openalex-snapshot
State splitting for variable-length graphs (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1987.1057296openalex-snapshot
Binary transmission codes with higher order spectral zeros at zero frequency (Corresp.)
inferredcites →https://doi.org/10.1109/tmag.1984.1063328openalex-snapshot
Lower bounds on the minimum hamming distance achievable with runlengh constrained or DC free block codes and the synthesis of a (16,8) Dmin= 4 DC free block code
inferredcites →https://doi.org/10.1109/tmag.1985.1063964openalex-snapshot
The synthesis of magnetic recording trellis codes with good hamming distance properties
inferredcites →https://doi.org/10.1109/tmag.1985.1063972openalex-snapshot
Recording codes for digital magnetic storage
inferredcites →https://doi.org/10.1109/tmag.1986.1064518openalex-snapshot
Binary rate four eighths, runlength constrained, error correcting magnetic recording modulation code
inferredcites →https://doi.org/10.1109/tmag.1987.1065193openalex-snapshot
Combined error correction/Modulation codes
inferredcites →https://doi.org/10.1147/rd.144.0376openalex-snapshot
Sequence-state Methods for Run-length-limited Coding

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9780470661291.ch5openalex-snapshot
Digital Transmission Techniques
inferred← citeshttps://doi.org/10.1002/9781118676684.ch5openalex-snapshot
Digital Transmission Techniques
inferred← citeshttps://doi.org/10.1002/ett.4460070309openalex-snapshot
Upper bounds on the size of error‐correcting runlength‐limited codes
inferred← citeshttps://doi.org/10.1049/el:19920085openalex-snapshot
Some new runlength constrained binary modulation codes with error-correcting capabilities
inferred← citeshttps://doi.org/10.1109/18.104318openalex-snapshot
Runlength-limited codes for mixed-error channels
inferred← citeshttps://doi.org/10.1109/18.133257openalex-snapshot
Error and erasure control (d,k) block codes
inferred← citeshttps://doi.org/10.1109/18.179363openalex-snapshot
On the complete decoding of constrained codes
inferred← citeshttps://doi.org/10.1109/18.391254openalex-snapshot
Error-correcting two-dimensional modulation codes
inferred← citeshttps://doi.org/10.1109/18.79953openalex-snapshot
Bounds on the capacity of the bit-shift magnetic recording channel
inferred← citeshttps://doi.org/10.1109/access.2020.2985119openalex-snapshot
The Construction of Permutation Group Codes for Communication Systems: Prime or Prime Power?
inferred← citeshttps://doi.org/10.1109/access.2020.3049017openalex-snapshot
Injection Coding With Spectral Shaping Capability
inferred← citeshttps://doi.org/10.1109/afrcon.2007.4401559openalex-snapshot
Cancellation and error correction for narrowband interference with spectral nulls codes and OFDM modulation
inferred← citeshttps://doi.org/10.1109/afrcon.2009.5308168openalex-snapshot
Distance-optimality study for permutation codes using cyclic-shift prefix/suffix technique
inferred← citeshttps://doi.org/10.1109/comsig.1991.278239openalex-snapshot
Some new error-correcting (d,k) trellis codes for clock extraction on bandwidth limited channels
inferred← citeshttps://doi.org/10.1109/csndsp.2018.8471854openalex-snapshot
Distance-Preserving Mapping with Euclidean Distance for 4-ary PAM
inferred← citeshttps://doi.org/10.1109/glocom.1990.116788openalex-snapshot
Bounds on the capacity of the peak shift magnetic recording channel
inferred← citeshttps://doi.org/10.1109/icc.1990.117355openalex-snapshot
Performance comparison of combined ECC/RLL codes
inferred← citeshttps://doi.org/10.1109/icc.1994.368726openalex-snapshot
Error-correcting two-dimensional modulation codes
inferred← citeshttps://doi.org/10.1109/isit.1991.695311openalex-snapshot
Extended Inverse Hamming Distance Preserving Mappings For Constrained Codes
inferred← citeshttps://doi.org/10.1109/isit.2001.936142openalex-snapshot
Permutation trellis codes
inferred← citeshttps://doi.org/10.1109/isit.2005.1523503openalex-snapshot
On the distance optimality of permutation mappings
inferred← citeshttps://doi.org/10.1109/isit.2006.261810openalex-snapshot
A Multilevel Construction for Mappings from Binary Sequences to Permutation Sequences
inferred← citeshttps://doi.org/10.1109/isplc.2005.1430522openalex-snapshot
Simulation results for permutation Trellis codes using M-ary FSK
inferred← citeshttps://doi.org/10.1109/isplc.2006.1716896openalex-snapshot
Combined Non-Binary Codes and M-FSK Modulation for Power Line Communications
inferred← citeshttps://doi.org/10.1109/tcomm.1994.580204openalex-snapshot
Some construction methods for error-correcting (d,k) codes
inferred← citeshttps://doi.org/10.1109/tcomm.2005.858683openalex-snapshot
Permutation Trellis Codes
inferred← citeshttps://doi.org/10.1109/tit.2003.809507openalex-snapshot
Distance-preserving mappings from binary vectors to permutations
inferred← citeshttps://doi.org/10.1109/tit.2006.878175openalex-snapshot
A Generalized Upper Bound and a Multilevel Construction for Distance-Preserving Mappings
inferred← citeshttps://doi.org/10.1109/tit.2007.915706openalex-snapshot
Distance-Preserving and Distance-Increasing Mappings From Ternary Vectors to Permutations
inferred← citeshttps://doi.org/10.1109/vetecf.2000.883295openalex-snapshot
Interference cancellation with permutation trellis codes
inferred← citeshttps://doi.org/10.1142/9789812832245_0013openalex-snapshot
Distance-Preserving Mappings
inferred← citeshttps://doi.org/10.12720/jcm.16.5.167-174openalex-snapshot
Injection Coding with Spectral Nulls for Even Codeword Lengths
inferred← citeshttps://doi.org/10.23919/saiee.2012.8532203openalex-snapshot
A Comparative Study on the Distance-Optimality for Distance-Preserving Mappings Constructions with Cyclic-Shift Prefix Technique
inferred← citeshttps://doi.org/10.24425/123555openalex-snapshot
Trellis Coded 4-ary PAM using Distance-Preserving Mapping
inferred← citeshttps://doi.org/10.24425/ijet.2020.131891openalex-snapshot
Permutation Coding with Injections for Modified PAM System
inferred← citeshttps://doi.org/10.31577/cai_2023_1_157openalex-snapshot
Adding RLL Properties to Four CCSDS LDPC Codes without Increasing Their Redundancy
inferred← citeshttps://doi.org/10.3390/e26080685openalex-snapshot
Dynamic Injection and Permutation Coding for Enhanced Data Transmission
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.