Preview

User

Not a user? Register with this site Forgot your password?

Proceedings in Cybernetics

Advanced search

Generalized Walsh–Hadamard codes

https://doi.org/10.35266/1999-7604-2026-1-10

Abstract

The paper proposes an optimization method of the Walsh–Hadamard codes, the augmented Walsh code and the p-ary Walsh–Hadamard code, via matrix encryption by a code matrix. The study shows that the upgrade does not affect the process of error detection and correction. Decoding algorithms using code matrices are developed as an addition to list decoding. In the p-ary case, the authors demonstrate the efficiency of the optimization method in handling errors of different types such as substitution, erasure, and appearance of a symbol.

 
 
 

About the Authors

M. S. Bespalov
Vladimir State University, Vladimir
Russian Federation

Doctor of Sciences (Physics and Mathematics)


K. A. Frolov
JSC “RPC “Istok” named after Shokin”, Fryazino
Russian Federation

Employee


References

1. Беспалов М. С., Фролов К. А. Кодирование информации линейными перестановками дискретного преобразования Уолша // Вестник кибернетики. 2024. Т. 23, № 3. С. 90–95.

2. Мак-Вильямс Ф. Дж., Слоэн Н. Дж. А. Теория кодов, исправляющих ошибки. М. : Связь, 1979. 744 с.

3. Heng I., Cooke C. H. Error correcting codes associated with complex Hadamard matrices // Applied Mathematics Letters. 1998. Vol. 11, no. 4. P. 77–80.

4. Кузнецов Ю. В., Шкарин С. А. Коды Рида – Маллера (обзор публикаций) // Математические вопросы кибернетики. Вып. 6. М. : Наука, 1996. С. 5–50.

5. Беспалов М. С. Собственные подпространства дискретного преобразования Уолша // Проблемы передачи информации. 2010. Т. 46, № 3. С. 60–79.

6. Беспалов М. С., Скляренко В. А. Дискретные функции Уолша и их приложения. Владимир : Изд-во ВлГУ, 2014. 68 с.

7. Малоземов В. Н. Линейная алгебра без определителей. Квадратичная функция. СПб. : Изд-во С.-Петербург. ун-та, 1997. 80 с.

8. Delsarte P., Goethals J. M. Tri-weight codes and generalized Hadamard matrices // Information and Control. 1969. Vol. 15, no. 2. P. 196–206.

9. Беспалов М. С. Дискретное преобразование Крестенсона // Проблемы передачи информации. 2010. Т. 46, № 4. С. 91–115.

10. Abbe E., Shpilka A., Ye M. Reed-Muller codes: Theory and algorithms // IEEE Transactions on Information Theory. 2020. Vol. 67, no. 6. P. 3251–3277.

11. Key J. D., McDonough T. P., Mavron V. C. Reed-Muller codes and permutation decoding // Discrete Mathematics. 2010. Vol. 310, no. 22. P. 3114–3119.

12. Barrolleta R. D., Villanueva M. Partial permutation decoding for binary linear and Z4-linear Hadamard codes // Designs, Codes and Cryptography. 2018. Vol. 86, no. 3. P. 569–586.

13. Bernal J. J., Simón J. J. New advances in permutation decoding of first-order Reed-Muller codes // Finite Fields and Their Applications. 2023. Vol. 88.

14. Bernal J. J., Simón J. J. Permutation decoding of first-order generalized Reed-Muller codes // Journal of Algebra and Its Applications. 2025. https://doi.org/10.48550/arXiv.2509.11757.

15. Li Z., Lin S.-J., Hu H. On the arithmetic complexities of Hamming codes and Hadamard codes // Journal of Latex Class Files. 2018. https://doi.org/10.48550/arXiv.1804.09903.


Review

For citations:

Bespalov M.S., Frolov K.A. Generalized Walsh–Hadamard codes. Proceedings in Cybernetics. 2026;25(1):101-108. (In Russ.) https://doi.org/10.35266/1999-7604-2026-1-10

Views: 95

JATS XML


Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.


ISSN 1999-7604 (Online)

628412, Khanty-Mansi Autonomous Okrug – Yugra, Surgut, Lenina pr. 1

Processing of personal data
supported by NEICON (Elpub lab)