RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 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.

UDC: 621.391.15

Received: 16.09.2014
Revised: 04.04.2017


 English version:
Problems of Information Transmission, 2017, 53:3, 242–250

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025