Siam journal on discrete mathematics vol:17 issue:2 pages:254-263
Shannon suggested investigating a binary multiplying channel and asked for a maximal uniquely decodable symmetric code. Motivated by his example, we de. ne such a code, called a Shannon set, for an arbitrary ring. We investigate the Shannon sets for the rings F-q(n x n) for n is an element of N, and the rings Z(m)=Z/(mZ) for m is an element of N.