We will try to answer the above question by analyzing the stopping times (which is the time after which the deck of cards is completely random) of the card shuffling process.
Suppose there is a graph G, whose vertices are letters in an alphabet A and in which adjacency means that the letters can be confused in a transmission.
