Abstract
We use a generalized Gray isometry in order to construct a previously unknown nonlinear (96, 236, 24) code as the image of a Z8-linear Hensel lift of the binary Golay code. The union of this code with a relevant coset yields a (96, 237, 24) code. The tables in 2, and 12 show that this code and some of its shortenings are better than the best (non)linear binary codes known so far. For instance, the best earlier known code of length 96 and minimum distance 24 had 233 words.
Original language | English (US) |
---|---|
Pages (from-to) | 1596-1598 |
Number of pages | 3 |
Journal | IEEE Transactions on Information Theory |
Volume | 47 |
Issue number | 4 |
DOIs | |
State | Published - May 2001 |
Keywords
- Binary Golay code
- Codes over rings
- Gray isometry
- Hensel lifting
- Homogeneous weight
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications
- Library and Information Sciences