Title data
Kiermaier, Michael ; Wassermann, Alfred:
On the minimum Lee distance of quadratic residue codes over ℤ₄.
In:
2008 IEEE International Symposium on Information Theory proceedings. 
Piscataway, NJ
: Institute of Electrical and Electronics Engineers (IEEE)
,
2008
.  pp. 26172619
ISBN 9781424422562
DOI: https://doi.org/10.1109/ISIT.2008.4595465
Project information
Project title: 



Project financing: 
Deutsche Forschungsgemeinschaft 
Abstract in another language
The class of the quadratic residue codes (QRcodes) over the ring ℤ₄ contains very good ℤ₄linear codes. It is well known that the Gray images of the QRcodes over ℤ₄ of length 8, 32 and 48 are nonlinear binary codes of higher minimum Hamming distance than comparable known linear codes. The QRCode of length 48 is also the largest one whose exact minimum Lee distance was known. We developed a fast algorithm to compute the minimum Lee distance of QRcodes over ℤ₄, and applied it to all ℤ₄linear QRcodes up to length 98. The QRcode of length 80 has minimum Lee distance 26. Thus it is a new example of a ℤ₄linear code which is better than any known comparable linear code.
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 > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics > Chair Mathematics and Didactics 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:21 
Last Modified:  25 Nov 2014 15:21 
URI:  https://eref.unibayreuth.de/id/eprint/3901 