bei Google ScholarTitelangaben
Kohnert, Axel:
Update on the extension of good linear codes.
In: Electronic Notes in Discrete Mathematics.
Bd. 26
(1 September 2006)
.
- S. 81-85.
ISSN 1571-0653
DOI: https://doi.org/10.1016/j.endm.2006.08.015
Abstract
In this short note we state how we construct new good linear codes C over the finite field with q elements. We start with already good (= high minimum distance d for given length n and dimension k) codes which we got for example by our method [2,3,4,5]. The advantage of this method is that we explictly get the words of minimum weight d. We try to extend the generator matrix of C by adding
columns with the property that at least s of the letters added to the codewords are different from 0. Using this we know that the minimum distance of the extended code is d + s as long as the second smallest weight was ≥ d + s.
Weitere Angaben
| Publikationsform: | Artikel in einer Zeitschrift |
|---|---|
| Begutachteter Beitrag: | Ja |
| Keywords: | finite projective geometry; coding theory; linear codes; minimum weight |
| Institutionen der Universität: | Fakultäten > Fakultät für Mathematik, Physik und Informatik > Mathematisches Institut > Lehrstuhl Mathematik II (Computeralgebra) Fakultäten Fakultäten > Fakultät für Mathematik, Physik und Informatik Fakultäten > Fakultät für Mathematik, Physik und Informatik > Mathematisches Institut |
| Titel an der UBT entstanden: | Ja |
| Themengebiete aus DDC: | 500 Naturwissenschaften und Mathematik > 510 Mathematik |
| Eingestellt am: | 22 Jan 2015 15:04 |
| Letzte Änderung: | 16 Sep 2016 09:42 |
| URI: | https://eref.uni-bayreuth.de/id/eprint/5797 |