Title of article
Isoperimetric theorems in the binary sequences of finite lengths Original Research Article
Author/Authors
R. Ahlswede، نويسنده , , N. Cai، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1998
Pages
6
From page
121
To page
126
Abstract
We 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.
Keywords
Isoperimetry , Hamming distance , View the MathML source , Sequence spaces , Insertions , Deletions
Journal title
Applied Mathematics Letters
Serial Year
1998
Journal title
Applied Mathematics Letters
Record number
896706
Link To Document