Asymptotically optimal matrix codes with Hamming and rank distances

2021 ◽  
Vol 131 ◽  
pp. 102264
Author(s):  
Ghurumuruhan Ganesan
2021 ◽  
pp. 105632
Author(s):  
Martin Ehler ◽  
Ujué Etayo ◽  
Bianca Gariboldi ◽  
Giacomo Gigante ◽  
Thomas Peter

2012 ◽  
Vol 58 (2) ◽  
pp. 1163-1185 ◽  
Author(s):  
Reza Omrani ◽  
Gagan Garg ◽  
P. Vijay Kumar ◽  
Petros Elia ◽  
Pankaj Bhambhani

1995 ◽  
Vol 05 (02) ◽  
pp. 275-280 ◽  
Author(s):  
BEATE BOLLIG ◽  
MARTIN HÜHNE ◽  
STEFAN PÖLT ◽  
PETR SAVICKÝ

For circuits the expected delay is a suitable measure for the average case time complexity. In this paper, new upper and lower bounds on the expected delay of circuits for disjunction and conjunction are derived. The circuits presented yield asymptotically optimal expected delay for a wide class of distributions on the inputs even when the parameters of the distribution are not known in advance.


2003 ◽  
Vol 31 (2) ◽  
pp. 14-16 ◽  
Author(s):  
Lachlan L. H. Andrew ◽  
Yuliy Baryshnikov ◽  
E. G. Coffman ◽  
Stephen V. Hanly ◽  
Jolyon White

2016 ◽  
Vol 35 (5) ◽  
pp. 528-564 ◽  
Author(s):  
Yanbo Li ◽  
Zakary Littlefield ◽  
Kostas E. Bekris

2008 ◽  
Vol 27 (4) ◽  
pp. 441-475 ◽  
Author(s):  
Alexander G. Tartakovsky ◽  
Venugopal V. Veeravalli

Sign in / Sign up

Export Citation Format

Share Document