Improved lower bounds on sizes of single-error correcting codes |
| |
| Authors: | Simon Litsyn Beniamin Mounits |
| |
| Institution: | (1) Department of Electrical Engineering, Tel Aviv University, Tel Aviv, Israel;(2) CWI, Amsterdam, The Netherlands |
| |
| Abstract: | A construction of codes of length n = q + 1 and minimum Hamming distance 3 over  is given. Substitution of the derived codes into a concatenation construction yields nonlinear binary single-error correcting codes with better than known parameters. In particular, new binary single-error correcting codes having more codewords than the best previously known in the range n ≤ 512 are obtained for the lengths 64–66, 128–133, 256–262, and 512. |
| |
| Keywords: | A(n d) MDS code Weight distribution |
| 本文献已被 SpringerLink 等数据库收录！ |
|
