On extended 1-perfect bitrades

12/03/2020
by   Evgeny Bespalov, et al.
0

We prove the equivalence of several definitions of extended 1-perfect bitrades in the Hamming graph H(n,q) and prove the nonexistence of such bitrades for odd n.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/04/2018

Weighted Hamming Metric Structures

A weighted Hamming metric is introduced in [4] and it showed that the bi...
research
12/19/2019

On existence of perfect bitrades in Hamming graphs

A pair (T_0,T_1) of disjoint sets of vertices of a graph G is called a p...
research
05/10/2022

Matrix and graph representations of vine copula structures

Vine copulas can efficiently model a large portion of probability distri...
research
10/28/2019

A* with Perfect Potentials

Quickly determining shortest paths in networks is an important ingredien...
research
01/27/2021

Equivalence of Non-Perfect Secret Sharing and Symmetric Private Information Retrieval with General Access Structure

We study the equivalence between non-perfect secret sharing (NSS) and sy...
research
11/20/2018

Extended formulations from communication protocols in output-efficient time

Deterministic protocols are well-known tools to obtain extended formulat...

Please sign up or login with your details

Forgot password? Click here to reset