Work

On q-ary Codes with Two Distances d and d + 1

Year: 2020

Type: article

Abstract: 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.

Source: Problems of Information Transmission

DOI: 10.1134/s0032946020010044

Authors: P. Boyvalenkov, K. Delchev, D. V. Zinoviev, V. A. Zinoviev

Institutions: South-West University "Neofit Rilski", Bulgarian Academy of Sciences, Institute of Mathematics and Informatics, Russian Academy of Sciences, Institute for Information Transmission Problems

Language: English

Topic: Coding theory and cryptography

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: green

Funders: National Science Foundation, Institute for Information and Communications Technology Promotion

OpenAlex ID: W3016866485

FWCI: 2.126

Cites: 14

Cited by: 9

Related to: 10