On q-ary Codes with Two Distances d and d + 1
| Autor: | Victor Zinoviev, Peter Boyvalenkov, Dmitrii Zinoviev, Konstantin Delchev |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Block code
Discrete mathematics Computer Networks and Communications 020206 networking & telecommunications 02 engineering and technology Computer Science Applications 020303 mechanical engineering & transports 0203 mechanical engineering Simple (abstract algebra) 0202 electrical engineering electronic engineering information engineering Cardinality (SQL statements) Equidistant Information Systems Mathematics |
| Zdroj: | Problems of Information Transmission. 56:33-44 |
| ISSN: | 1608-3253 0032-9460 |
| DOI: | 10.1134/s0032946020010044 |
| Popis: | We consider q-ary block codes with exactly two distances: d and d + 1. Several constructions of such codes are given. In the linear case, we show that all codes can be obtained by a simple modification of linear equidistant codes. Upper bounds for the maximum cardinality of such codes are derived. Tables of lower and upper bounds for small q and n are presented. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink