๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A Generic Construction of Complex Codebooks Meeting the Welch Bound

โœ Scribed by Cunsheng Ding; Tao Feng

Book ID
114640869
Publisher
IEEE
Year
2007
Tongue
English
Weight
243 KB
Volume
53
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A lower bound on the size of a complex g
A lower bound on the size of a complex generated by an antichain
โœ P. Frankl ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 427 KB

A short proof of the following result of Kleitman is given: the total number of sets contained in some member of an antichain of size (i) over the n-set is at least (E) + l --+ (i) for 0 < k G in. An equally short proof of Harper's isoperimetric theorem is provided as well.