Nonlinear q-ary codes with large code distance
- 作者: Stepanov S.A.1
-
隶属关系:
- Kharkevich Institute for Information Transmission Problems
- 期: 卷 53, 编号 3 (2017)
- 页面: 242-250
- 栏目: Coding Theory
- URL: https://journals.rcsi.science/0032-9460/article/view/166411
- DOI: https://doi.org/10.1134/S003294601703005X
- ID: 166411
如何引用文章
详细
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
补充文件
