on the publication serverTitle data
Kiermaier, Michael ; Zwanzger, Johannes:
A new series of ℤ₄-linear codes of high minimum Lee distance derived from the Kerdock codes.
In:
Edelmayer, András (Hrsg.): Proceedings of the 19th International Symposium on Mathematical Theory of Networks and Systems. -
Budapest
,
2010
. - pp. 929-932
ISBN 978-963-311-370-7
Project information
| Project title: |
|
||||
|---|---|---|---|---|---|
| Project financing: |
Deutsche Forschungsgemeinschaft |
Abstract in another language
A new series of ℤ₄-linear codes of high minimum Lee distance is given. It is derived from the ℤ₄-linear
representation of the Kerdock codes. The Gray image of the
smallest of these codes is a nonlinear binary (114, 2⁸, 56)-code, and in the second smallest case the Gray image is a nonlinear binary (1988, 2¹², 992)-code. Both codes have at least twice as many codewords as any linear binary code of equal length and minimum distance.
Further data
| Item Type: | Article in a book |
|---|---|
| Refereed: | Yes |
| Institutions of the University: | Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics > Chair Mathematics II Faculties Faculties > Faculty of Mathematics, Physics und Computer Science Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics |
| Result of work at the UBT: | Yes |
| DDC Subjects: | 500 Science > 510 Mathematics |
| Date Deposited: | 25 Nov 2014 15:28 |
| Last Modified: | 25 Nov 2014 15:28 |
| URI: | https://eref.uni-bayreuth.de/id/eprint/3902 |
