pith. sign in

arxiv: 0806.2513 · v3 · pith:UOKM2M25new · submitted 2008-06-16 · 💻 cs.IT · math.IT

The Perfect Binary One-Error-Correcting Codes of Length 15: Part I--Classification

classification 💻 cs.IT math.IT
keywords codeslengthperfectbinaryone-error-correctingclassificationthereblackmore
0
0 comments X
read the original abstract

A complete classification of the perfect binary one-error-correcting codes of length 15 as well as their extensions of length 16 is presented. There are 5983 such inequivalent perfect codes and 2165 extended perfect codes. Efficient generation of these codes relies on the recent classification of Steiner quadruple systems of order 16. Utilizing a result of Blackmore, the optimal binary one-error-correcting codes of length 14 and the (15, 1024, 4) codes are also classified; there are 38408 and 5983 such codes, respectively.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.