Email this article Nonlinear q-ary codes with large code distance
- Authors: Stepanov S.A.1
-
Affiliations:
- Kharkevich Institute for Information Transmission Problems
- Issue: Vol 53, No 3 (2017)
- Pages: 242-250
- Section: Coding Theory
- URL: https://journal-vniispk.ru/0032-9460/article/view/166411
- DOI: https://doi.org/10.1134/S003294601703005X
- ID: 166411
Cite item
Open Access
Access granted
Subscription Access
Abstract
We construct a family of nonlinear q-ary codes obtained from the corresponding families of modified complex Butson–Hadamard matrices. Parameters of the codes are quite close to the Plotkin bound and in a number of cases attain this bound. Furthermore, these codes admit rather simple encoding and decoding procedures.
About the authors
S. A. Stepanov
Kharkevich Institute for Information Transmission Problems
Author for correspondence.
Email: sa-stepanov@iitp.ru
Russian Federation, Moscow
Supplementary files
