Decoding a Given Coded Message or Sentence
Reasoning › Coding-Decoding · Topic 4.6
Decoding a coded message means working backwards from coded words or sentences to their meaning. For sentence codes in a made-up language, a word that is common to two sentences has a code that is common to the two codes; matching common words with common codes, and then removing the matched pairs, decodes every word. For letter-coded messages, apply the reverse of the coding rule.
8 min read · Reasoning · Coding-Decoding
Quick Answer
Decoding a coded message means working backwards from coded words or sentences to their meaning. For sentence codes in a made-up language, a word that is common to two sentences has a code that is common to the two codes; matching common words with common codes, and then removing the matched pairs, decodes every word. For letter-coded messages, apply the reverse of the coding rule.
At a Glance
- Sentence codes Match common words with common codes
- Elimination Remove matched pairs, then repeat
- Letter messages Apply the reverse of the rule
- Minimum data A word needs to appear in two sentences
- Unknown word Cannot be decoded if it appears only once with others
- Check Re-code your answer
Where Does It Fit?
This is the sixth topic of the Coding-Decoding macro. It reverses the encoding skills of Letter Coding (Direct, Shifted and Reverse Alphabet Coding) and Substitution Coding (Words Substituted for Other Words), and prepares you for made-up language puzzles in Fictitious/Made-Up Language Coding Problems where whole sentences are given in an invented tongue.
How Do You Decode Sentence Codes?
In short: a word common to two sentences gets the code that is common to the two coded sentences, so compare sentences in pairs, find the shared word and shared code, and then deduce the rest.
Take three sentences in a made-up language.
| Sentence | Code |
|---|---|
| eat sweet mango | ka na ta |
| mango is sweet | ta ma na |
| eat fresh mango | ka sa ta |
- Sentences 1 and 3: the common words are eat and mango, and the common codes are ka and ta.
- Sentences 1 and 2: the common words are sweet and mango, and the common codes are na and ta.
- Mango: it appears in all three sentences and ta is in all three codes, so mango = ta.
- Others: then sweet = na, eat = ka.
Common-word method
- Pick two sentences that share exactly one word, so that the common code is one code.
- If two words are shared, find a third sentence that contains only one of them.
- Remove the deduced pairs and repeat until the asked word is found.
How Do You Decode When Only Two-Word Sentences Are Given?
In short: with two-word sentences, the common word in two sentences fixes one pair, and the other words follow by elimination.
- Example: fresh fruit = mo ke, fruit juice = ke pa, fresh juice = mo pa. Fresh is common to the first and third sentences, and mo is common to their codes, so fresh = mo. Fruit is common to the first two, and ke is common, so fruit = ke. Then juice = pa.
- Why order does not matter: in most exam codes the order of the code words does not follow the order of the English words. Do not assume that the first code is the first word.
- When a word is undecodable: a word that occurs in only one sentence cannot be tied to a single code unless every other word in that sentence is already known.
A fourth sentence can be added to separate two words that always occur together, as red and apple do in the examples below. The same logic with invented words is the focus of Fictitious/Made-Up Language Coding Problems.
How Do You Decode Letter-Coded Messages?
In short: apply the opposite of the coding rule to each letter of the code, and re-code the answer to check it.
| Coding rule | Decoding step | Example |
|---|---|---|
| Each letter moved +1 | Move each letter back 1 | IFMMP decodes to HELLO |
| Opposite letters (sum 27) | Apply the same opposite rule again | SVOOL decodes to HELLO |
| Letters reversed | Reverse again | NALP decodes to PLAN |
| Progressive +1, +2, +3 | Subtract 1, 2, 3 in order | SQDH decodes to ROAD |
Opposite-letter coding is its own inverse, so decoding is the same process as coding. Shifts need the reverse direction. The full set of letter rules is in Letter Coding (Direct, Shifted and Reverse Alphabet Coding), and a decoded message can be checked by re-coding it using Coding by Analogy (Deriving the Coding Pattern from a Given Example).
Solved Examples
Example 1
Question: In a code language, ‘eat sweet mango’ is ‘ka na ta’, ‘mango is sweet’ is ‘ta ma na’, and ‘eat fresh mango’ is ‘ka sa ta’. What is the code for ‘sweet’?
- Sentences 1 and 3 share eat and mango, so ka and ta are their codes in some order.
- Sentences 1 and 2 share sweet and mango, so na and ta are their codes in some order.
- Ta is common to all three, so mango = ta. Then sweet = na.
Answer: The code of sweet is na.
Example 2
Question: ‘good red apple’ is ‘tom ba si’, ‘red apple tree’ is ‘ba si ro’, ‘good tree’ is ‘tom ro’ and ‘apple pie’ is ‘si pu’. What is the code for red?
- From the first two sentences, red apple is ba si in some order. Good is tom, because it is common to sentences 1 and 3.
- Apple pie is si pu. Apple is common to sentences 1, 2 and 4, and si is common, so apple = si.
- Then red = ba.
Answer: The code of red is ba.
Example 3
Question: If ‘fresh fruit’ is ‘mo ke’, ‘fruit juice’ is ‘ke pa’ and ‘fresh juice’ is ‘mo pa’, what is the code of juice?
- Fresh is common to sentences 1 and 3, and mo is common, so fresh = mo.
- Fruit is common to sentences 1 and 2, and ke is common, so fruit = ke.
- The remaining word juice has the remaining code pa.
Answer: The code of juice is pa.
Example 4
Question: A message is sent with each letter moved one place forward. What does IFMMP say?
- Move each letter one place back: I to H, F to E, M to L, M to L, P to O.
Answer: IFMMP decodes to HELLO.
Example 5
Question: A message is sent in the opposite-letter (reverse alphabet) code. What does WLT say?
- The opposite of W (23) is 27 – 23 = 4, which is D.
- The opposite of L (12) is 15, which is O. The opposite of T (20) is 7, which is G.
Answer: WLT decodes to DOG.
Shortcuts and Tricks
- Choose pairs of sentences that share only one word. This avoids ambiguity.
- Write each deduced word and code next to the sentences, and cross them out.
- Do not assume the order of code words follows the order of English words.
- For letter decoding, write the code under the shifted alphabet to see the reverse movement.
- Re-code your answer to check that it matches the given code exactly.
Common Mistakes
- Assuming the first code word is the first English word.
- Pairing words and codes that appear in only one sentence.
- Decoding a shifted message by moving letters in the same direction instead of the opposite one.
- Forgetting that opposite-letter decoding is the same as opposite-letter coding.
- Stopping after one match and not using elimination for the remaining words.
Practice Questions
- Using the mango sentences of Example 1, what is the code of mango?
- Using the sentences of Example 2, what is the code of tree?
- Each letter of a message is moved one place forward. What does DBU say?
- A message uses the opposite-letter code. Decode the word given as WLT.
- ‘go home’ is ‘ab cd’ and ‘home sweet’ is ‘cd ef’. What is the code of sweet?
- ‘cat runs fast’ is ‘x y z’, ‘fast car’ is ‘z w’ and ‘cat car’ is ‘x w’. What is the code of runs?
Answers: 1) ta; 2) ro; 3) CAT; 4) DOG; 5) ef; 6) y.
Why Is This Topic Important?
- Different skill Decoding tests deduction rather than calculation.
- Exam use Sentence codes appear in SSC, banking and CDS papers.
- Link to logic The elimination habit is used in Syllogism with Two Statements and Two Conclusions.
- Foundation It leads directly to made-up language puzzles in Fictitious/Made-Up Language Coding Problems.
What Comes Next?
The next topic is Coding Based on Jumbled or Reversed Letters Within a Word. It looks at codes in which the letters of a word are jumbled or reversed inside the word.
Key Terms and Formulas
- Decoding Working back from the code to the message
- Common word A word that occurs in two sentences
- Common code A code that occurs in two coded sentences
- Elimination Removing deduced pairs
- Inverse rule The opposite of the coding rule
- Made-up language An invented set of code words
Related Topics
- Coding by Analogy (Deriving the Coding Pattern from a Given Example)
- Coding Based on Jumbled or Reversed Letters Within a Word
- Letter Coding (Direct, Shifted and Reverse Alphabet Coding)
- Number Coding (Assigning Numeric Values to Letters/Words)
Exam Corner
Points to Remember
- A common word has a common code.
- Order of code words need not match the order of words.
- Use a third sentence to separate two words that appear together.
- Reverse the shift to decode a shifted message.
- Opposite-letter coding is self-inverse.
Do Not Confuse With
- Coding vs decoding Coding goes from message to code; decoding goes from code to message.
- Common word vs common code Match a common word to a common code, not to any code.
- Shift vs reverse shift Decoding a +1 shift needs a -1 shift.
- Order of words vs order of codes They need not be the same.
Memory Hook
Common word, common code; reverse the rule to decode.
GS Relevance
Frequently Asked Questions
How do you decode a coded sentence in reasoning?
Compare two coded sentences that share exactly one word. The word that is common to both English sentences has the code that is common to both coded sentences. Fix that pair, remove it, and repeat with other sentence pairs until the asked word is decoded.
What is the common word method in coding-decoding?
The common word method says that if a word occurs in two sentences, then the code that occurs in both coded sentences is the code of that word. It works only when exactly one word and one code are shared, otherwise another sentence is needed to separate them.
How do you decode a message coded by shifting letters?
Apply the reverse of the shift to each letter. If every letter was moved two places forward, move each letter two places back, and wrap around from A to Z. Write positions to check. Opposite-letter codes are decoded by applying the opposite rule again.
Can a word always be decoded from the given sentences?
No. A word can be decoded only if it appears in at least two sentences or if all other words in its only sentence are already decoded. If it occurs once with unknown companions, the code cannot be determined, and the answer is that the data is insufficient.
Does the order of code words follow the order of words?
Not usually. In most exam questions the code words are in a different order from the English words, so you must not assume the first code word is the first English word. The order of codes is decided only by matching common words and codes.
PYQ Practice — Statement Analysis
1 In sentence coding, a word common to two sentences has the code common to the two coded sentences.
This is the basis of the common-word method.
2 In a made-up language the first code word always stands for the first word of the sentence.
The order is usually mixed, so words must be matched by common words and common codes.
3 Opposite-letter coding is decoded by applying the opposite rule once more.
The opposite of the opposite is the original letter, since positions sum to 27.
4 A letter message coded by moving each letter one place forward is decoded by moving each letter one place forward again.
It is decoded by moving each letter one place back.
Related Topics
Browse the full Reasoning index