AI Chat AI Image Generator AI Video Text to Speech

A construction of product blocks with a fixed block size

05/08/2018

∙

by Sergey Bereg, et al.

∙

∙

Let M(n,d) be the maximum size of a permutation array on n symbols with pairwise Hamming distance at least d. Some permutation arrays can be constructed using blocks of certain type bmmms-arx-18 caled product blocks in this paper. We study the problem of designing (q,k)-product blocks with a fixed block size k.

page 1

page 2

page 3

page 4

research

∙ 02/24/2023

Improved Bounds for Permutation Arrays Under Chebyshev Distance

Permutation arrays under the Chebyshev metric have been considered for e...

0 Sergey Bereg, et al. ∙

research

∙ 09/28/2021

Multiple contractions of permutation arrays

Given a permutation σ on n symbols {0, 1, …, n-1} and an integer 1 ≤ m ≤...

0 Carmen Amarra, et al. ∙

research

∙ 06/08/2020

PSPACE-completeness of Pulling Blocks to Reach a Goal

We prove PSPACE-completeness of all but one problem in a large space of ...

0 Joshua Ani, et al. ∙

research

∙ 09/08/2019

A Generalized Configuration Model with Degree Correlations and Its Percolation Analysis

In this paper we present a generalization of the classical configuration...

0 Duan-Shin Lee, et al. ∙

research

∙ 03/22/2020

1 x 1 Rush Hour with Fixed Blocks is PSPACE-complete

Consider n^2-1 unit-square blocks in an n × n square board, where each b...

0 Josh Brunner, et al. ∙

research

∙ 04/11/2018

Maximizing Hamming Distance in Contraction of Permutation Arrays

A permutation array A is set of permutations on a finite set Ω, say of ...

0 Sergey Bereg, et al. ∙

research

∙ 09/07/2021

Congruence Closure Modulo Permutation Equations

We present a framework for constructing congruence closure modulo permut...

0 Dohan Kim, et al. ∙