Abstract
We use a generalized Gray isometry in order to construct a previously unknown nonlinear (96, 2(36), 24) code as the image of a Z(8)-linear Hensel lift of the binary Golay code. The union of this code with a relevant coset yields a (96, 2(37), 24) code. The tables in [2], and [12] show that this rode 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 2(33) words.
Original language | English |
---|---|
Pages (from-to) | 1596-1598 |
Number of pages | 3 |
Journal | IEEE Transactions on Information Theory |
Volume | 47 |
Issue number | 4 |
DOIs | |
Publication status | Published - May 2001 |
MoE publication type | A1 Journal article-refereed |
Keywords
- binary Golay code
- codes over rings
- Gray isometry
- Hensel lifting
- homogeneous weight