首页
学术期刊
论文检测
AIGC检测
热点
更多
数据
ON THE OPTIMAL STRUCTURE OF RECOVERING SET PAIRS IN LATTICES - THE SANDGLASS CONJECTURE
被引:8
作者
:
AHLSWEDE, R
论文数:
0
引用数:
0
h-index:
0
机构:
UNIV BIELEFELD,FAK MATH,W-4800 BIELEFELD 1,GERMANY
AHLSWEDE, R
SIMONYI, G
论文数:
0
引用数:
0
h-index:
0
机构:
UNIV BIELEFELD,FAK MATH,W-4800 BIELEFELD 1,GERMANY
SIMONYI, G
机构
:
[1]
UNIV BIELEFELD,FAK MATH,W-4800 BIELEFELD 1,GERMANY
[2]
HUNGARIAN ACAD SCI,INST MATH,H-1053 BUDAPEST V,HUNGARY
来源
:
DISCRETE MATHEMATICS
|
1994年
/ 128卷
/ 1-3期
关键词
:
D O I
:
10.1016/0012-365X(94)90129-5
中图分类号
:
O1 [数学];
学科分类号
:
0701 ;
070101 ;
摘要
:
We present a conjecture concerning the optimal structure of a subset pair satisfying two dual requirements in a lattice that can be derived as the product of k finite length chains. The conjecture is proved for k = 2.
引用
收藏
页码:389 / 394
页数:6
相关论文
共 2 条
[1]
COHEN G, 1988, B I MAT ACAD SINICA, V16, P385
[2]
ON WRITE-UNIDIRECTIONAL MEMORY CODES
[J].
SIMONYI, G
论文数:
0
引用数:
0
h-index:
0
SIMONYI, G
.
IEEE TRANSACTIONS ON INFORMATION THEORY,
1989,
35
(03)
:663
-669
←
1
→
共 2 条
[1]
COHEN G, 1988, B I MAT ACAD SINICA, V16, P385
[2]
ON WRITE-UNIDIRECTIONAL MEMORY CODES
[J].
SIMONYI, G
论文数:
0
引用数:
0
h-index:
0
SIMONYI, G
.
IEEE TRANSACTIONS ON INFORMATION THEORY,
1989,
35
(03)
:663
-669
←
1
→