|
Problemy Peredachi Informatsii, 2017, Volume 53, Issue 3, Pages 44–53
(Mi ppi2242)
|
|
|
|
Coding Theory
Nonlinear $q$-ary codes with large code distance
S. A. Stepanov Kharkevich Institute for Information Transmission Problems,
Russian Academy of Sciences, Moscow, Russia
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.
Received: 16.09.2014 Revised: 04.04.2017
Citation:
S. A. Stepanov, “Nonlinear $q$-ary codes with large code distance”, Probl. Peredachi Inf., 53:3 (2017), 44–53; Problems Inform. Transmission, 53:3 (2017), 242–250
Linking options:
https://www.mathnet.ru/eng/ppi2242 https://www.mathnet.ru/eng/ppi/v53/i3/p44
|
Statistics & downloads: |
Abstract page: | 282 | Full-text PDF : | 40 | References: | 43 | First page: | 22 |
|