Showing results 1 to 16 of 16
| Title | Author(s) | Issue Date | |
|---|---|---|---|
Asymptotic upper bounds for ramsey functions Journal:Graphs and Combinatorics | 2001 | ||
Asymptotics of input-constrained erasure channel capacity Journal:IEEE Transactions on Information Theory | 2018 | ||
Capacity of multilevel NAND flash memory channels Journal:IEEE Transactions on Information Theory | 2017 | ||
Concavity of mutual information rate of finite-state channels Proceeding/Conference:IEEE International Symposium on Information Theory. Proceedings | 2013 | ||
Differential methods for finding independent sets in hypergraphs Journal:SIAM Journal on Discrete Mathematics | 2006 | ||
| 2022 | |||
Endomorphisms Preserving Coordinates of Polynomial Algebras Journal:Algebra Colloquium | 2013 | ||
The Independence Number of Graphs with a Forbidden Cycle and Ramsey Numbers Journal:Journal of Combinatorial Optimization | 2003 | ||
Input-Constrained Erasure Channels: Mutual Information and Capacity Proceeding/Conference:I E E E International Symposium on Information Theory Proceedings | 2014 | ||
The lower bound on independence number Journal:Science in China, Series A: Mathematics, Physics, Astronomy | 2002 | ||
On the capacity of multilevel NAND flash memory channels Proceeding/Conference:IEEE International Symposium on Information Theory Proceedings | 2016 | ||
On the Capacity of the Flash Memory Channel with Inter-cell Interference Proceeding/Conference:IEEE International Symposium on Information Theory (ISIT) Proceedings | 2019 | ||
Ramsey functions involving Km,n large Journal:Discrete Mathematics | 2005 | ||
Ramsey numbers involving large dense graphs and bipartite Turán numbers Journal:Journal of Combinatorial Theory. Series B | 2003 | ||
Recent Results on Input-Constrained Erasure Channels: A Case Study for Markov Approximation Proceeding/Conference:Workshop on Beyond I.I.D. in Information Theory | 2017 | ||
An upper bound for ramsey numbers Journal:Applied Mathematics Letters | 2004 |