Projects per year
The maximum size of unrestricted binary three-error-correcting codes has been known up to the length of the binary Golay code, with two exceptions. Specifically, denoting the maximum size of an unrestricted binary code of length n and minimum distance d by A(n, d), it has been known that 64 ≤ A(18 , 8 ) ≤ 68 and 128 ≤ A(19 , 8 ) ≤ 131. In the current computer-aided study, it is shown that A(18 , 8 ) = 64 and A(19 , 8 ) = 128 , so an optimal code is obtained even after shortening the extended binary Golay code six times.
|Number of pages||7|
|Journal||Designs, Codes and Cryptography|
|Early online date||13 Aug 2018|
|Publication status||Published - 15 Mar 2019|
|MoE publication type||A1 Journal article-refereed|
- Double counting
- Error-correcting code
- Golay code
- UNRESTRICTED CODES
- ERROR-CORRECTING CODES
FingerprintDive into the research topics of 'The sextuply shortened binary Golay code is optimal'. Together they form a unique fingerprint.
- 1 Finished
Construction and Classification of Discrete Mathematic Structures
Kokkala, J., Laaksonen, A., Östergård, P., Szollosi, F., Pöllänen, A., Ganzhinov, M. & Heinlein, D.
01/09/2015 → 31/08/2019
Project: Academy of Finland: Other research funding