In the exam 2015b_moed-a , Question 2d:
How do I prove that a certain word is at distance greater than 2 from any codeword ?
In this questions, that will mean that there are words that are not contained in the subset, hence A does not contain all words.
The word: [0,0,0,0,0,0,0,0,0,1,1,1,0,0,0]
(R1,R2,R3 = 1, the rest are zeroes)