AI Chat AI Image Generator AI Video AI Music Generator

On q-ary codes with two distances d and d+1

06/23/2019

∙

by P. Boyvalenkov, et al.

∙

∙

The q-ary block codes with two distances d and d+1 are considered. Several constructions of such codes are given, as in the linear case all codes can be obtained by a simple modification of linear equidistant codes. Upper bounds for the maximum cardinality of such codes is derived. Tables of lower and upper bounds for small q and n are presented.

P. Boyvalenkov
1 publication
K. Delchev
1 publication
D. Zinoviev
1 publication
V. Zinoviev
1 publication

page 1

page 2

page 3

page 4

research

∙ 05/27/2020

On two-weight codes

We consider q-ary block codes with exactly two distances: d and d+δ. Sev...

0 P. G. Boyvalenkov, et al. ∙

research

∙ 10/16/2019

Universal Bounds for Size and Energy of Codes of Given Minimum and Maximum Distances

We employ signed measures that are positive definite up to certain degre...

0 Peter Boyvalenkov, et al. ∙

research

∙ 11/13/2020

Bounds for the multilevel construction

One of the main problems in random network coding is to compute good low...

0 Tao Feng, et al. ∙

research

∙ 03/29/2023

On Lattice Constructions D and D' from q-ary Linear Codes

Multilevel lattice codes, such as the associated to Constructions C, , D...

0 Franciele do Carmo Silva, et al. ∙

research

∙ 11/23/2018

On three domination numbers in block graphs

The problems of determining minimum identifying, locating-dominating or ...

0 Aline Parreau, et al. ∙

research

∙ 06/21/2021

Strong Singleton type upper bounds for linear insertion-deletion codes

The insertion-deletion codes was motivated to correct the synchronizatio...

0 Hao Chen, et al. ∙

research

∙ 02/26/2023

Optimal local identifying and local locating-dominating codes

We introduce two new classes of covering codes in graphs for every posit...

0 Pyry Herva, et al. ∙