Title :
Asymptotic enumeration of binary matrices with bounded row and column weights
Author :
Ordentlich, Erik ; Parvaresh, Farzad ; Roth, Ron M.
Author_Institution :
Hewlett-Packard Labs., Palo Alto, CA, USA
fDate :
July 31 2011-Aug. 5 2011
Abstract :
Consider the set An of all n×n binary matrices in which the number of 1´s in each row and column is at most n/2. We show that the redundancy, n2 - log2 |An|, of this set equals ρn + o(n), for a constant ρ ≈ 1.42515.
Keywords :
binary codes; matrix algebra; asymptotic enumeration; binary matrices; bounded row; column weights; Silicon;
Conference_Titel :
Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on
Conference_Location :
St. Petersburg
Print_ISBN :
978-1-4577-0596-0
Electronic_ISBN :
2157-8095
DOI :
10.1109/ISIT.2011.6033804
