Study guide

3.3 Codes, Ciphers & Letter Substitution

Kent Test 11+ Kent Selective Eligibility Test

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: English & Reading Comprehension

1.1 Reading Comprehension & Inference Strategies 1.2 Vocabulary, Synonyms, Antonyms & Context Clues 1.3 Grammar, Syntax & Sentence Structure 1.4 Punctuation, Spelling Rules & Proofreading 1.5 Sentence Completion: Choosing the Best Word

2 Chapter 2: Mathematics & Problem Solving

2.1 Numbers, Place Value, Decimals & Four Operations 2.2 Fractions, Percentages & Ratio 2.3 Sequences, Patterns & Algebra Foundations 2.4 Perimeter, Area & Compound Shapes 2.5 Data Handling, Probability & Word Problems 2.6 Factors, Multiples, Primes & Divisibility 2.7 Time, Money & Unit Conversion 2.8 Angles, Coordinates, 3D Shape & Volume

3 Chapter 3: Verbal Reasoning

3.1 Word-Based VR (Analogies, Synonyms & Odd One Out) 3.2 Word Building, Hidden Words & Compound Words 3.3 Codes, Ciphers & Letter Substitution 3.4 Logic, Letter Sequences & Statement Relationships 3.5 Double-Meaning Words & Two-Pair Matching 3.6 Number-Based Verbal Reasoning

4 Chapter 4: Non-Verbal & Spatial Reasoning

4.1 Shape Sequences, Series & Progressive Matrices 4.2 Shape Analogies, Similarities & Odd One Out 4.3 Spatial Reasoning: Rotation, Reflection & Symmetry 4.4 3D Spatial Reasoning, Nets & Cube Folding 4.5 Hidden & Embedded Target Shapes 4.6 Shape Codes & Letter-Coded Figures

5 Chapter 5: The Writing Exercise, Scoring & Exam Strategy

5.1 The Writing Exercise: Planning, Structure & Descriptive Technique 5.2 Kent Test Format, Age Standardisation & Qualifying Scores 5.3 Exam Strategy, Time Management & Answer Sheet Mechanics 5.4 Registration, Eligibility & Test-Day Logistics 5.5 Writing Prompts & the Headteacher Assessment Route

3.3 Codes, Ciphers & Letter Substitution

Key Takeaways Explain This Topic AI

Alphabet shift codes follow consistent numerical mathematical steps (+N, -N, or alternating offsets) across positions.

Always write down or reference a quick 1-26 alphabetical index grid to calculate letter shifts without memory errors.

Unkeyed code group matching relies on analyzing letter frequencies, double letters, and unique character repetitions.

Number-for-letter substitution codes map alphabet positions to numbers, sometimes requiring sum or difference calculations.

When shifting past 'Z' or 'A', wrap around the alphabet boundary seamlessly (e.g., Z + 2 = B, A - 2 = Y).

Last updated: August 2026

3.3 Codes, Ciphers & Letter Substitution

Code questions are among the most predictable and high-scoring sections of the Kent Test 11+ Verbal Reasoning paper. They test a student's ability to recognize abstract patterns, apply consistent mathematical transformations to letters, and analyze positional structures.

1. Alphabet Position Shifts (+N, -N & Alternating Shifts)

In alphabet shift ciphers, each letter in a word is shifted forward (+) or backward (-) by a fixed number of positions in the alphabet.

Alphabet Quick Reference Table

To work efficiently, memorize the numerical positions of benchmark letters (e.g., A = 1 , E = 5 , J = 10 , O = 15 , T = 20 , Y = 25 A=1, E=5, J=10, O=15, T=20, Y=25 A = 1 , E = 5 , J = 10 , O = 15 , T = 20 , Y = 25 ) or reference the complete 1–26 grid:

  • A B C D E F G H I J K L M
  • 1 2 3 4 5 6 7 8 9 10 11 12 13
  • N O P Q R S T U V W X Y Z
  • 14 15 16 17 18 19 20 21 22 23 24 25 26
  • Shift Patterns in 11+ Exams

Constant Shift (+N or -N): Every letter shifts by the same constant offset.

Example: + 3 +3 + 3 shift → \rightarrow → C ( 3 ) → F ( 6 ) C(3) \rightarrow F(6) C ( 3 ) → F ( 6 ) , O ( 15 ) → R ( 18 ) O(15) \rightarrow R(18) O ( 15 ) → R ( 18 ) , L ( 12 ) → O ( 15 ) L(12) \rightarrow O(15) L ( 12 ) → O ( 15 ) , D ( 4 ) → G ( 7 ) D(4) \rightarrow G(7) D ( 4 ) → G ( 7 ) . COLD becomes FROG .

Progressive Shift: The shift increases with each letter position ( + 1 , + 2 , + 3 , + 4 +1, +2, +3, +4 + 1 , + 2 , + 3 , + 4 ).

Alternating Shift: Shifts alternate between addition and subtraction ( + 1 , − 1 , + 2 , − 2 +1, -1, +2, -2 + 1 , − 1 , + 2 , − 2 ).

Alphabet Wrap-Around Rules:

Moving forward past Z wraps back to A: Z ( + 1 ) = A , Z ( + 2 ) = B Z(+1) = A, Z(+2) = B Z ( + 1 ) = A , Z ( + 2 ) = B .

Moving backward past A wraps back to Z: A ( − 1 ) = Z , A ( − 2 ) = Y A(-1) = Z, A(-2) = Y A ( − 1 ) = Z , A ( − 2 ) = Y .

Worked Example: Constant +3 Shift

Question: If the word COLD is written in code as FROG , how would you write the word WARM in the same code?

Analyze COLD → \rightarrow → FROG:

  • C ( 3 ) + 3 = 6 ( F ) C (3) + 3 = 6 (F) C ( 3 ) + 3 = 6 ( F )
  • O ( 15 ) + 3 = 18 ( R ) O (15) + 3 = 18 (R) O ( 15 ) + 3 = 18 ( R )
  • L ( 12 ) + 3 = 15 ( O ) L (12) + 3 = 15 (O) L ( 12 ) + 3 = 15 ( O )
  • D ( 4 ) + 3 = 7 ( G ) D (4) + 3 = 7 (G) D ( 4 ) + 3 = 7 ( G )

Apply +3 to WARM:

  • W ( 23 ) + 3 = 26 ( Z ) W (23) + 3 = 26 (Z) W ( 23 ) + 3 = 26 ( Z )
  • A ( 1 ) + 3 = 4 ( D ) A (1) + 3 = 4 (D) A ( 1 ) + 3 = 4 ( D )
  • R ( 18 ) + 3 = 21 ( U ) R (18) + 3 = 21 (U) R ( 18 ) + 3 = 21 ( U )
  • M ( 13 ) + 3 = 16 ( P ) M (13) + 3 = 16 (P) M ( 13 ) + 3 = 16 ( P )

Code for WARM: ZDUP .

2. Letter-for-Letter Cipher Substitution

In letter substitution codes, letters are mapped directly to other letters according to a fixed key. Unlike shift codes, the mapping may not follow a simple arithmetic step, but is constant across all words in that question.

Deciphering Matrix Example

Suppose you are given two example words and their codes:

  • BOAT → \rightarrow → XQZP
  • TEAM → \rightarrow → PZMR

From these two pairs, extract the exact letter-to-code mapping: B → X , O → Q , A → Z , T → P T → P , E → M , A → Z , M → R \begin{aligned}

  • B &\rightarrow X, & O &\rightarrow Q, & A &\rightarrow Z, & T &\rightarrow P \\
  • T &\rightarrow P, & E &\rightarrow M, & A &\rightarrow Z, & M &\rightarrow R
  • \end{aligned} B T ​ → X , → P , ​ O E ​ → Q , → M , ​ A A ​ → Z , → Z , ​ T M ​ → P → R ​

Notice that A → Z A \rightarrow Z A → Z and T → P T \rightarrow P T → P match in both words. This confirms our substitution key!

Problem: How would you code the word BEAT ?

  • B → X B \rightarrow X B → X
  • E → M E \rightarrow M E → M
  • A → Z A \rightarrow Z A → Z
  • T → P T \rightarrow P T → P

Encoded Word: XMZP .

3. Number-to-Letter & Arithmetic Ciphers

Number-to-letter codes replace each letter with its numerical position in the alphabet ( A = 1 , B = 2 … Z = 26 A=1, B=2 \dots Z=26 A = 1 , B = 2 … Z = 26 ) or a transformed number value.

Common Variants

Direct Indexing: C − A − T = 3 − 1 − 20 C-A-T = 3-1-20 C − A − T = 3 − 1 − 20 .

Reverse Indexing: A = 26 , B = 25 … Z = 1 A=26, B=25 \dots Z=1 A = 26 , B = 25 … Z = 1 .

Word Total Sum: Summing the letter values ( C A T = 3 + 1 + 20 = 24 CAT = 3 + 1 + 20 = 24 C A T = 3 + 1 + 20 = 24 ).

Worked Example: Word Total Sum

Question: If CAT is coded as 24 ( 3 + 1 + 20 3+1+20 3 + 1 + 20 ), what is the numerical code for DOG ?

Calculate DOG:

  • D = 4 D = 4 D = 4
  • O = 15 O = 15 O = 15
  • G = 7 G = 7 G = 7

Sum = 4 + 15 + 7 = 26 \text{Sum} = 4 + 15 + 7 = 26 Sum = 4 + 15 + 7 = 26 .

Code for DOG: 26 .

4. Pattern Matching Unkeyed Code Groups

A classic GL Assessment VR question presents four words and four scrambled code groups, asking you to match a specific code to a target word without knowing the cipher in advance.

  • Target Words: [ BEAR , DARE , DEAR , BIRD ]
  • Code Groups: [ 1234 , 5342 , 5234 , 1645 ]
  • Step-by-Step Pattern Extraction Matrix

Feature Word Analysis Code Group Matching Resulting Match

Unique Letter Test BIRD is the only word with 'I' and 'D'. Look for unique digits. Match BIRD ↔ \leftrightarrow ↔ 1645

Shared Ends BEAR , DARE , DEAR all end in 'R' or 'E'. 1234 , 5342 , 5234 all end in 4 or 2. R = 4 R=4 R = 4 or E = 4 E=4 E = 4 .

Letter Breakdown BEAR starts with 'B'. BIRD starts with 'B'. Both 1234 and 1645 start with 1 . B = 1 .

Isolate DEAR D D D must equal 5 (since DARE and DEAR start with 5 ). E E E is 2nd letter in DEAR . 5234 has 2 as 2nd digit. DEAR = 5234 .

Final Match for BEAR: Starts with B ( 1 ) B(1) B ( 1 ) , contains E ( 2 ) E(2) E ( 2 ) , A ( 3 ) A(3) A ( 3 ) , R ( 4 ) R(4) R ( 4 ) → \rightarrow → 1234 .

Loading diagram... Pattern Matching Strategy for Unkeyed Code Sets