Linearly representable codes over chain rings (Q1969663): Difference between revisions

A chain ring is an associative ring with identity for which the left ideals form a chain. A code \(C\) of length \(n\) over a chain ring \(R\) is a subset of \(R^n\). Code \(C\) over chain ring \(R\) is called linear if it is either a left or a right \(R\)-module. Using a chain of linear codes over a finite field \(F\), a linear code over a finite chain ring can be mapped to a linear code \(D\) over \(F\). In this case, code \(D\) is called linearly representable over a chain ring. In the paper several properties of linearly representable codes over chain rings are studied. A code over a chain ring can also be viewed as a multiset of points in a projective Hjelmslev geometry. Using this geometric approach, it is proved that certain MacDonald codes are linearly representable over chain rings. Moreover, examples of multisets of points in Hjelmslev spaces are given that yield linear codes over finite fields with a high minimum distance.