AbstractWe solve the isoperimetric problem for subsets in the set χ∗ of binary sequences of finite length for two cases: 1.(1) the distance counting the minimal number of insertions and deletions transforming one sequence into another;2.(2) the distance, where in addition also exchanges of letters are allowed.In the earlier work, the range of the competing subsets was limited to the sequences χn of length n
M(n, d) denotes a maximal set of n-place binary sequences with entries 0 and 1 such that the Hamming...
M(n, d) denotes a maximal set of n-place binary sequences with entries 0 and 1 such that the Hamming...
International audienceThe paper studies an isoperimetric problem for the Gaussian measure and coordi...
We consider a variant of what is known as the discrete isoperimetric problem, namely the problem of ...
AbstractLet Ω be the probability space of all 0–1 sequences of length n, with P((ai)1n) = pΣai(1 − p...
We consider a variant of what is known as the discrete isoperimetric problem, namely the problem of ...
AbstractCombinatorial problems with a geometric flavor arise if the set of all binary sequences of a...
Some upper bounds are given on the number of sequences of n binary symbols which can be found such t...
Ahlswede R, Cai N, Deppe C. An isoperimetric theorem for sequences generated by feedback and feedbac...
Let Ω be the probability space of all 0-1 sequences of length n, with P((ai)1n) = pΣai(1 - p)n - Σai...
We present here a description of all solutions of the isoperimetric problem in Hamming space of some...
The celebrated isoperimetric theorem says that the circle provides the least-perimeter way to enclos...
This article is a study of the solution set of a discrete isoperimetric problem. 1 Introduction and ...
We establish a structure theorem for minimizing sequences for the isoperimetric problem on noncompac...
Let X = (x1,..., xn) be a finite binary sequence of length n, i.e., xi = ±1 for all i. The derived s...
M(n, d) denotes a maximal set of n-place binary sequences with entries 0 and 1 such that the Hamming...
M(n, d) denotes a maximal set of n-place binary sequences with entries 0 and 1 such that the Hamming...
International audienceThe paper studies an isoperimetric problem for the Gaussian measure and coordi...
We consider a variant of what is known as the discrete isoperimetric problem, namely the problem of ...
AbstractLet Ω be the probability space of all 0–1 sequences of length n, with P((ai)1n) = pΣai(1 − p...
We consider a variant of what is known as the discrete isoperimetric problem, namely the problem of ...
AbstractCombinatorial problems with a geometric flavor arise if the set of all binary sequences of a...
Some upper bounds are given on the number of sequences of n binary symbols which can be found such t...
Ahlswede R, Cai N, Deppe C. An isoperimetric theorem for sequences generated by feedback and feedbac...
Let Ω be the probability space of all 0-1 sequences of length n, with P((ai)1n) = pΣai(1 - p)n - Σai...
We present here a description of all solutions of the isoperimetric problem in Hamming space of some...
The celebrated isoperimetric theorem says that the circle provides the least-perimeter way to enclos...
This article is a study of the solution set of a discrete isoperimetric problem. 1 Introduction and ...
We establish a structure theorem for minimizing sequences for the isoperimetric problem on noncompac...
Let X = (x1,..., xn) be a finite binary sequence of length n, i.e., xi = ±1 for all i. The derived s...
M(n, d) denotes a maximal set of n-place binary sequences with entries 0 and 1 such that the Hamming...
M(n, d) denotes a maximal set of n-place binary sequences with entries 0 and 1 such that the Hamming...
International audienceThe paper studies an isoperimetric problem for the Gaussian measure and coordi...
DOI
Add to ORKG