Nonlinear q-ary codes with large code distance


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

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.

作者简介

S. Stepanov

Kharkevich Institute for Information Transmission Problems

编辑信件的主要联系方式.
Email: sa-stepanov@iitp.ru
俄罗斯联邦, Moscow

补充文件

附件文件
动作
1. JATS XML

版权所有 © Pleiades Publishing, Inc., 2017