|
|||||
|
|
Linearly representable codes over chain rings |
|
| Authors: | Thomas Honold Ivan Landjev |
| Affiliation: | 1. Zentrum Mathematik, Technische Universit?t München, D-80290, München, Germany 2. Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, 8 Acad. G. Bonchev str., 1113, Sofia, Bulgaria |
| Abstract: | In this paper, we consider linear codes over finite chain rings. We present a general mapping which produces codes over smaller alphabets. Under special conditions, these codes are linear over a finite field. We introduce the notion of a linearly representable code and prove that certain MacDonald codes are linearly representable. Finally, we give examples for good linear codes over finite fields obtained from special multisets in projective Hjelmslev planes. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |