On the public citation graph
An enumerative method for runlength-limited codes: permutation codes
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.
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.1109/18.335889openalex-snapshot
A new approach to constructing optimal block codes for runlength-limited channels
inferredcites →https://doi.org/10.1109/18.532899openalex-snapshot
Encoding of dklr-sequences using one weight set
inferredcites →https://doi.org/10.1109/18.623139openalex-snapshot
A practical method for approaching the channel capacity of constrained channels
inferredcites →https://doi.org/10.1109/18.681333openalex-snapshot
A modified concatenated coding scheme, with applications to magnetic data storage
inferredcites →https://doi.org/10.1109/49.124467openalex-snapshot
Finite-state modulation codes for data storage
inferredcites →https://doi.org/10.1109/colloq.1990.152797openalex-snapshot
Permutation codes, (d,k) codes and magnetic recording
inferredcites →https://doi.org/10.1109/tit.1972.1054729openalex-snapshot
Permutation codes for sources
inferredcites →https://doi.org/10.1117/12.45930openalex-snapshot
Enumerative modulation coding with arbitrary constraints and postmodulation error correction coding for data storage systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s11760-025-04049-zopenalex-snapshot
Distributed coding with sorting and assignment
inferred← citeshttps://doi.org/10.1016/s0165-1684(03)00063-xopenalex-snapshot
Robust indexing of lattices and permutation codes over binary symmetric channels
inferred← citeshttps://doi.org/10.1109/18.887880openalex-snapshot
Permutation (d,k) codes: efficient enumerative coding and phrase length distribution shaping
inferred← citeshttps://doi.org/10.1109/18.915673openalex-snapshot
Efficient coding schemes for the hard-square model
inferred← citeshttps://doi.org/10.1109/18.930945openalex-snapshot
Optimal block codes for M-ary runlength-constrained channels
inferred← citeshttps://doi.org/10.1109/49.920186openalex-snapshot
Low-complexity maximum-likelihood decoding of shortened enumerative permutation codes for holographic storage
inferred← citeshttps://doi.org/10.1109/access.2024.3376476openalex-snapshot
Quasi-Enumerative Coding of Balanced Run-Length Limited Codes
inferred← citeshttps://doi.org/10.1109/glocom.2011.6134474openalex-snapshot
Time-Space Constrained Codes for Phase-Change Memories
inferred← citeshttps://doi.org/10.1109/intmag.2005.1463928openalex-snapshot
On LDPC codes satisfying the (0, k) constraint
inferred← citeshttps://doi.org/10.1109/isit.2018.8437745openalex-snapshot
Codes Correcting Two Deletions
inferred← citeshttps://doi.org/10.1109/tcomm.2011.122110.090566openalex-snapshot
Permutation/Silence Coding in Partially Under-Utilized Cellular Networks
inferred← citeshttps://doi.org/10.1109/tit.2013.2257916openalex-snapshot
Time–Space Constrained Codes for Phase-Change Memories
inferred← citeshttps://doi.org/10.1109/tit.2020.3048905openalex-snapshot
Notice of Removal: A Novel Representation for Permutations
inferred← citeshttps://doi.org/10.1109/tit.2024.3375979openalex-snapshot
Eliminating Media Noise While Preserving Storage Capacity: Reconfigurable Constrained Codes for Two-Dimensional Magnetic Recording
inferred← citeshttps://doi.org/10.1109/tmag.2005.855329openalex-snapshot
LDPC codes satisfying the (0,k) constraint
inferred← citeshttps://doi.org/10.1117/12.464086openalex-snapshot
Constrained coding for the deep-space optical channel
inferred← citeshttps://doi.org/10.1134/s0032946010040095openalex-snapshot
Fast enumeration algorithm for words with given constraints on run lengths of ones
inferred← citeshttps://doi.org/10.1134/s0032946011010078openalex-snapshot
Enumeration of constant-weight run-length limited binary sequences
inferred← citeshttps://doi.org/10.1142/s0219749917400287openalex-snapshot
Quantization of high dimensional Gaussian vector using permutation modulation with application to information reconciliation in continuous variable QKD
inferred← citeshttps://doi.org/10.48550/arxiv.1107.1563openalex-snapshot
Designing Nonlinear Turbo Codes with a Target Ones Density
inferred← citeshttps://doi.org/10.48550/arxiv.1207.4530openalex-snapshot
Time-Space Constrained Codes for Phase-Change Memories
inferred← citeshttps://doi.org/10.70675/84e34a22z792fz4d12z8d08z21d5379db33aopenalex-snapshot
Contribution aux méthodes hybrides d'optimisation heuristique : Distribution et application à l'interopérabilité des systèmes d'information
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.