This dataset is devoted to 1-perfect codes. Currently, it is mainly focused on the concatenated ternary perfect codes, but there is also an additional content, see (3+) below, (1-2) This dataset contains all inequivalent concatenated ternary 1-perfect codes of length 13. Additionally, it contains some components necessary to obtain such concatenated codes, namely, collections of disjoint ternary distance-3 Reed-Muller-like codes of length 9, see p.(1) below.

Dataset Files

You must be an IEEE Dataport Subscriber to access these files. Subscribe now or login.

[1] Denis Krotov, "Perfect and Related Codes", IEEE Dataport, 2021. [Online]. Available: http://dx.doi.org/10.21227/w856-4b70. Accessed: Feb. 08, 2025.
@data{w856-4b70-21,
doi = {10.21227/w856-4b70},
url = {http://dx.doi.org/10.21227/w856-4b70},
author = {Denis Krotov },
publisher = {IEEE Dataport},
title = {Perfect and Related Codes},
year = {2021} }
TY - DATA
T1 - Perfect and Related Codes
AU - Denis Krotov
PY - 2021
PB - IEEE Dataport
UR - 10.21227/w856-4b70
ER -
Denis Krotov. (2021). Perfect and Related Codes. IEEE Dataport. http://dx.doi.org/10.21227/w856-4b70
Denis Krotov, 2021. Perfect and Related Codes. Available at: http://dx.doi.org/10.21227/w856-4b70.
Denis Krotov. (2021). "Perfect and Related Codes." Web.
1. Denis Krotov. Perfect and Related Codes [Internet]. IEEE Dataport; 2021. Available from : http://dx.doi.org/10.21227/w856-4b70
Denis Krotov. "Perfect and Related Codes." doi: 10.21227/w856-4b70