|
Diskretnyi Analiz i Issledovanie Operatsii, 2023, Volume 30, Issue 2, Pages 5–14 DOI: https://doi.org/10.33048/daio.2023.30.753
(Mi da1319)
|
|
|
|
A testing set for Preparata-like codes
A. Yu. Vasil'evaab a Sobolev Institute of Mathematics, 4 Acad. Koptyug Avenue, 630090 Novosibirsk, Russia
b Novosibirsk State University, 2 Pirogov Street, 630090 Novosibirsk, Russia
DOI:
https://doi.org/10.33048/daio.2023.30.753
Abstract:
The reconstruction of an object of a given class by its intersection with some (so-called testing) set is studied. For the class, we consider Preparata-like codes, i. e. nonlinear codes of length $n=2^{2m}-1,$ $m=2,3,\dots,$ with code distance $5$ and twice the size of a linear code of the same length and distance. We determine conditions under which the union of a few concentric spheres forms the testing set for Preparata-like codes.
Keywords:
Hamming graph, Preparata code, perfect code, testing set, Krawtchouk polynomial.
Received: 01.09.2022 Revised: 14.09.2022 Accepted: 16.09.2022
Citation:
A. Yu. Vasil'eva, “A testing set for Preparata-like codes”, Diskretn. Anal. Issled. Oper., 30:2 (2023), 5–14; J. Appl. Industr. Math., 17:2 (2023), 427–432
Linking options:
https://www.mathnet.ru/eng/da1319 https://www.mathnet.ru/eng/da/v30/i2/p5
|
|