Assuming 0 ♯ does not exist, we present a combinatorial approach to Jensen's method of coding by a real. The forcing uses combinatorial consequences of fine structure (including the Covering Lemma, in various guises), but makes no direct appeal to fine structure itself.

The following will be shown: Let I be a σ-ideal on a Polish space X so that the associated forcing of I+${\bf{\Delta }}_1^1$ sets ordered by ⊆ is a proper forcing. Let E be a ${\bf{\Sigma }}_1^1$ or a ${\bf{\Pi }}_1^1$ equivalence relation on X with all equivalence classes ${\bf{\Delta }}_1^1$. If for all $z \in {H_{{{\left}^ + }}}$, z♯ exists, then there exists an I+${\bf{\Delta }}_1^1$ set C ⊆ X such that E ↾ C is a ${\bf{\Delta }}_1^1$ equivalence (...) relation. (shrink)

If A ⊆ ω1, then there exists a cardinal preserving generic extension [MATHEMATICAL DOUBLE-STRUCK CAPITAL L][A ][x ] of [MATHEMATICAL DOUBLE-STRUCK CAPITAL L][A ] by a real x such that1) A ∈ [MATHEMATICAL DOUBLE-STRUCK CAPITAL L][x ] and A is Δ1HC in [MATHEMATICAL DOUBLE-STRUCK CAPITAL L][x ];2) x is minimal over [MATHEMATICAL DOUBLE-STRUCK CAPITAL L][A ], that is, if a set Y belongs to [MATHEMATICAL DOUBLE-STRUCK CAPITAL L][x ], then either x ∈ [MATHEMATICAL DOUBLE-STRUCK CAPITAL L][A, Y ] or Y (...) ∈ [MATHEMATICAL DOUBLE-STRUCK CAPITAL L][A ].The forcing we use implicitly provides reshaping of the given set A. (shrink)