Coding and Decoding

Module 11 — Lesson 0011 · In Depth · 45 min

Coding is a hidden rule — a key that maps letters to letters or letters to numbers. Your job is to reverse-engineer the key on a known pair, then apply it to the target. The key is almost always positions 1–26 plus a shift, mirror, or math operation.

1. The Foundation: Alphabet Numeration — 1 to 26

EJOTY (5,10,15,20,26) + Rule of 27 — the two speed tools for every coding problem.

Type	Mapping	Example
Forward (A→Z)	A=1 … Z=26	B=2, J=10, T=20
Reverse (Z→A)	Z=1 … A=26, or `Rev = 27 − Forward`	B forward 2 → reverse 25 → Y

2. Positional Shift Patterns

Fixed shift: every letter +k or −k. Formula: NewPos = (Original + k) mod 26. Example: +3 → A→D, B→E…
Position-based shift: shift depends on letter's place in the word — 1st +1, 2nd +2, 3rd +3…
Vowel / consonant shifts: different rules for vowels (A,E,I,O,U cycle) vs consonants (next consonant). Example: vowel→next vowel, consonant→next consonant.

3. Structural and Mirror Logic

Mirror pairs (27−P) and word manipulations (reverse, split-swap) are structural — no math, just rearrangement.

Mirror (opposite) rule: pair from start and end: A↔Z, B↔Y, C↔X… If forward position is P, mirror is at 27−P.
Reversing: CAT → TAC (entire word backward).
Splitting and swapping: DECIDE → DEC|IDE → IDEDEC (halves swapped; odd length → middle stays).

4. Advanced Mathematical Coding

Modulo 26 (wrap-around): when operation gives >26, wrap: Result = Calculated mod 26 (remainder; 0 → Z). Example: position 28 → 2 → B.
Sum of digits: position 15 (O) → 1+5=6 → F.
Square/power logic: position squared (or raised to word-position power) then mod 26.
Neighbor logic: letter replaced by average/sum of neighbors' positions.
Word length dependency: shift = f(length) — e.g., + length of word.

5. Systematic Solving Methodology — 5 Steps

Check direct numbering: is code simply sum or concatenation of positions? Quick test: sum positions of word and compare to code number.
Compare first and last letters: small distance → positional shift; large distance (A→Z) → mirror logic.
Analyze length: code length ≠ word length → mathematical summation or digit rule (sum of all positions as a number).
Check vowel/consonant bias: if only some letters follow pattern, rule changes for A,E,I,O,U.
Apply modulo and reverse: if rule fits but final word mismatches by 1 or is reversed, check wrap-around or final +1/ reversal step.

Direct → distance → length → vowel split → modulo/reverse — in that order.

6. Summary of Variables

Symbol	Meaning
`P`	Forward position 1–26
`M`	Mirror position = 27−P
`n`	Order in word (1st, 2nd, 3rd…)
`L`	Total word length
`k`	Constant shift/offset

Forward: E is?

Rule of 27: B forward 2 → reverse?

Mirror of C (3) is?

Fixed shift +3: A→?

Position-based: 1st +1, 2nd +2, 3rd +3 — first check?

CAT reversed is?

Modulo 26: calculated 28 → letter?

Step 1 of decoding is?

Notes

Numeration :-

Forward A1…Z26 ; EJOTY 5,10,15,20,26 ; Reverse =27−Forward ; Mirror A↔Z etc

Shifts :-

Fixed: New=P+k ; Positional: k depends on n (1st+1,2nd+2…) ; Vowel/consonant: split rule

Structure :-

Mirror: 27−P ; Reverse: CAT→TAC ; Split-swap: DECIDE→IDEDEC

Math :-

Mod26: result mod26 (0→Z) ; Sum digits, square/power, neighbor avg, length-dependent shift

Steps :-

1) Direct numbering → 2) First vs last distance (small→shift, large→mirror) → 3) Length (mismatch→math) → 4) Vowel bias → 5) Mod/reverse check

Primary source: none pinned yet — drop your preferred video/book resource into RESOURCES.md and it will be linked here. Ask me anything that's unclear.

← Prev: Calendar Next: Dices →

Questions? Ask your agent — you can follow up on any concept, quiz answer, or get extra practice problems tuned to this module.