On two-weight codes

05/27/2020
by   P. G. Boyvalenkov, et al.
0

We consider q-ary block codes with exactly two distances: d and d+δ. Several combinatorial constructions of optimal such codes are given. In the linear case, we prove that under certain conditions the existence of such linear 2-weight code with δ > 1 implies the following equality of great common divisors: (d,q) = (δ,q). Upper bounds for the maximum cardinality of such codes are derived by linear programming and from few-distance spherical codes. Tables of lower and upper bounds for small q = 2,3,4 and q n < 50 are presented.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/23/2019

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

The q-ary block codes with two distances d and d+1 are considered. Sever...
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...
research
01/09/2018

The DMT classification of real and quaternionic lattice codes

In this paper we consider space-time codes where the code-words are rest...
research
05/07/2021

Bounds for the sum of distances of spherical sets of small size

We derive upper and lower bounds on the sum of distances of a spherical ...
research
05/24/2019

Signature codes for weighted binary adder channel and multimedia fingerprinting

In this paper, we study the signature codes for weighted binary adder ch...
research
06/25/2021

Doubly-Exponential Identification via Channels: Code Constructions and Bounds

Consider the identification (ID) via channels problem, where a receiver ...
research
01/06/2018

Characterization and Efficient Search of Non-Elementary Trapping Sets of LDPC Codes with Applications to Stopping Sets

In this paper, we propose a characterization for non-elementary trapping...

Please sign up or login with your details

Forgot password? Click here to reset