|
Problemy Peredachi Informatsii, 2014, Volume 50, Issue 4, Pages 15–21
(Mi ppi2150)
|
|
|
|
Coding Theory
Optimal almost equisymbol codes based on difference matrices
L. A. Bassalygo, V. A. Zinoviev Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia
Abstract:
A method for constructing optimal almost equisymbol codes based on difference matrices is proposed. Some of these codes generate previously unknown optimal equidistant codes satisfying the Plotkin bound. As a consequence, they generate new resolvable balanced incomplete block designs.
Received: 30.12.2013
Citation:
L. A. Bassalygo, V. A. Zinoviev, “Optimal almost equisymbol codes based on difference matrices”, Probl. Peredachi Inf., 50:4 (2014), 15–21; Problems Inform. Transmission, 50:4 (2014), 313–319
Linking options:
https://www.mathnet.ru/eng/ppi2150 https://www.mathnet.ru/eng/ppi/v50/i4/p15
|
Statistics & downloads: |
Abstract page: | 324 | Full-text PDF : | 87 | References: | 58 | First page: | 14 |
|