Mohammad Amin Shokrollahi
Faculty of Basic Sciences, École Polytechnique Fédérale de Lausanne
List of publications from the DBLP Bibliography Server - FAQ| 2013 | ||
|---|---|---|
| j27 | Mohammad Ali Ahmadi, Mohammad Ebadi, Amin Shokrollahi, Seyed Mohammad Javad Majidi: Evolving artificial neural network and imperialist competitive algorithm for prediction oil flow rate of the reservoir. Appl. Soft Comput. 13(2): 1085-1098 (2013) | |
| c29 | Amin Shokrollahi: A class of generalized RS-codes with faster encoding and decoding algorithms. ITA 2013: 1-10 | |
| i12 | Amin Karbasi, Amir Hesam Salavati, Amin Shokrollahi: Coupled Neural Associative Memories. CoRR abs/1301.1555 (2013) | |
| i11 | Amin Karbasi, Amir Hesam Salavati, Amin Shokrollahi, Lav Varshney: Neural Networks Built from Unreliable Components. CoRR abs/1301.6265 (2013) | |
| i10 | Amir Hesam Salavati, K. Raj Kumar, Amin Shokrollahi: A Non-Binary Associative Memory with Exponential Pattern Retrieval Capacity and Iterative Learning: Extended Results. CoRR abs/1302.1156 (2013) | |
| 2012 | ||
| j26 | Mahdi Cheraghchi, Frédéric Didier, Amin Shokrollahi: Invertible Extractors and Wiretap Protocols. IEEE Transactions on Information Theory 58(2): 1254-1274 (2012) | |
| j25 | Ghid Maatouk, Amin Shokrollahi: Analysis of the Second Moment of the LT Decoder. IEEE Transactions on Information Theory 58(5): 2558-2569 (2012) | |
| i9 | Masoud Alipour, Omid Etesami, Ghid Maatouk, Amin Shokrollahi: Irregular Product Codes. CoRR abs/1206.2276 (2012) | |
| 2011 | ||
| j24 | Mohammad H. Taghavi, Amin Shokrollahi, Paul H. Siegel: Efficient Implementation of Linear Programming Decoding. IEEE Transactions on Information Theory 57(9): 5960-5982 (2011) | |
| c28 | Amin Shokrollahi: LT-Codes and Phase Transitions for Mutual Information - (Invited Talk). ICITS 2011: 94-99 | |
| c27 | Yuval Cassuto, Mohammad Amin Shokrollahi: Array-code ensembles -or- two-dimensional LDPC codes. ISIT 2011: 518-522 | |
| c26 | Amir Hesam Salavati, K. Raj Kumar, Mohammad Amin Shokrollahi, Wulfram Gerstnery: Neural pre-coding increases the pattern retrieval capacity of Hopfield and Bidirectional Associative Memories. ISIT 2011: 850-854 | |
| c25 | Michael Luby, Mohammad Amin Shokrollahi: Slepian-Wolf type problems on the erasure channel. ISIT 2011: 2771-2775 | |
| i8 | Joachim Rosenthal, Mohammad Amin Shokrollahi, Judy L. Walker: Coding Theory (Dagstuhl Seminar 11461). Dagstuhl Reports 1(11): 50-65 (2011) | |
| 2009 | ||
| j23 | Mohammad Amin Shokrollahi, Michael Luby: Raptor Codes. Foundations and Trends in Communications and Information Theory 6(3-4): 213-322 (2009) | |
| c24 | Ehsan Ardestanizadeh, Mahdi Cheraghchi, Amin Shokrollahi: Bit precision analysis for compressed sensing. ISIT 2009: 1-5 | |
| c23 | Payam Pakzad, Venkat Anantharam, Amin Shokrollahi: Bounds on the mutual informations of the binary sums of Bernoulli random variables. ISIT 2009: 304-308 | |
| c22 | Mahdi Cheraghchi, Frédéric Didier, Amin Shokrollahi: Invertible extractors and wiretap protocols. ISIT 2009: 1934-1938 | |
| c21 | Ghid Maatouk, Amin Shokrollahi: Analysis of the second moment of the LT decoder. ISIT 2009: 2326-2330 | |
| c20 | Harm S. Cronie, Bertrand Ndzana Ndzana, Amin Shokrollahi: Decoding algorithms for binary Raptor codes over nonbinary channels. ISIT 2009: 2487-2491 | |
| c19 | Mahdi Cheraghchi, Amin Shokrollahi: Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties. STACS 2009: 277-288 | |
| i7 | Mahdi Cheraghchi, Frédéric Didier, Amin Shokrollahi: Invertible Extractors and Wiretap Protocols. CoRR abs/0901.2120 (2009) | |
| i6 | Ehsan Ardestanizadeh, Mahdi Cheraghchi, Amin Shokrollahi: Bit Precision Analysis for Compressed Sensing. CoRR abs/0901.2147 (2009) | |
| i5 | Mohammad H. Taghavi, Amin Shokrollahi, Paul H. Siegel: Efficient implementation of linear programming decoding. CoRR abs/0902.0657 (2009) | |
| i4 | Mahdi Cheraghchi, Amin Shokrollahi: Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties. CoRR abs/0902.1254 (2009) | |
| i3 | Ghid Maatouk, Amin Shokrollahi: Analysis of the Second Moment of the LT Decoder. CoRR abs/0902.3114 (2009) | |
| 2008 | ||
| j22 | Amin Shokrollahi: Asymmetric information embedding. Appl. Algebra Eng. Commun. Comput. 19(3): 229-239 (2008) | |
| c18 | Bertrand Ndzana Ndzana, Andrew W. Eckford, Amin Shokrollahi, Gil I. Shamir: Fountain codes for piecewise stationary channels. ISIT 2008: 2242-2246 | |
| 2007 | ||
| c17 | Lorenz Minder, Amin Shokrollahi: Cryptanalysis of the Sidelnikov Cryptosystem. EUROCRYPT 2007: 347-360 | |
| c16 | Joachim von zur Gathen, Amin Shokrollahi, Jamshid Shokrollahi: Efficient Multiplication Using Type 2 Optimal Normal Bases. WAIFI 2007: 55-68 | |
| 2006 | ||
| j21 | Omid Etesami, Amin Shokrollahi: Raptor codes on binary memoryless symmetric channels. IEEE Transactions on Information Theory 52(5): 2033-2051 (2006) | |
| j20 | ||
| c15 | Bertrand Ndzana Ndzana, Amin Shokrollahi, Jürgen Abel: Burrows-Wheeler Text Compression with Fountain Codes. DCC 2006: 462 | |
| 2005 | ||
| j19 | Mahmoud Rashidpour, Amin Shokrollahi, Seyed Hamaidreza Jamali: Optimal regular LDPC codes for the binary erasure channel. IEEE Communications Letters 9(6): 546-548 (2005) | |
| c14 | Andrew Brown, Lorenz Minder, Amin Shokrollahi: Improved Decoding of Interleaved AG Codes. IMA Int. Conf. 2005: 37-46 | |
| i2 | Payam Pakzad, Christina Fragouli, Amin Shokrollahi: Coding Schemes for Line Networks. CoRR abs/cs/0508124 (2005) | |
| i1 | Elitza N. Maneva, Amin Shokrollahi: New model for rigorous analysis of LT-codes. CoRR abs/cs/0512029 (2005) | |
| 2002 | ||
| j18 | Mohammad Amin Shokrollahi: Computing the performance of unitary space-time group codes from their character table. IEEE Transactions on Information Theory 48(6): 1355-1371 (2002) | |
| j17 | P. Oswald, Amin Shokrollahi: Capacity-achieving sequences for the erasure channel. IEEE Transactions on Information Theory 48(12): 3017-3028 (2002) | |
| e1 | Gholamreza B. Khosrovshahi, Ali Shokoufandeh, Mohammad Amin Shokrollahi (Eds.): Theoretical Aspects of Computer Science, Advanced Lectures (First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000). Lecture Notes in Computer Science 2292, Springer 2002, isbn 3-540-43328-7 | |
| 2001 | ||
| j16 | Joe Buhler, Richard E. Crandall, Reijo Ernvall, Tauno Metsänkylä, Mohammad Amin Shokrollahi: Irregular Primes and Cyclotomic Invariants to 12 Million. J. Symb. Comput. 31(1/2): 89-96 (2001) | |
| j15 | Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman: Efficient erasure correcting codes. IEEE Transactions on Information Theory 47(2): 569-584 (2001) | |
| j14 | Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman: Improved low-density parity-check codes using irregular graphs. IEEE Transactions on Information Theory 47(2): 585-598 (2001) | |
| j13 | Thomas J. Richardson, Mohammad Amin Shokrollahi, Rüdiger L. Urbanke: Design of capacity-approaching irregular low-density parity-check codes. IEEE Transactions on Information Theory 47(2): 619-637 (2001) | |
| j12 | Amin Shokrollahi, Babak Hassibi, Bertrand M. Hochwald, Wim Sweldens: Representation theory for high-rate multiple-antenna code design. IEEE Transactions on Information Theory 47(6): 2335-2367 (2001) | |
| c13 | Mohammad Amin Shokrollahi: Design of Differential Space-Time Codes Using Group Theory. AAECC 2001: 22-35 | |
| 2000 | ||
| j11 | Joe Buhler, Mohammad Amin Shokrollahi, Volker Stemann: Fast and precise Fourier transforms. IEEE Transactions on Information Theory 46(1): 213-228 (2000) | |
| c12 | Mohammad Amin Shokrollahi: An Introduction to Low-Density Parity-Check Codes. Theoretical Aspects of Computer Science 2000: 175-197 | |
| c11 | ||
| c10 | Vadim Olshevsky, Mohammad Amin Shokrollahi: Matrix-vector product for confluent Cauchy-like matrices with application to confluent rational interpolation. STOC 2000: 573-581 | |
| 1999 | ||
| j10 | Sandra Feisel, Joachim von zur Gathen, Amin Shokrollahi: Normal bases via general Gauss periods. Math. Comput. 68(225): 271-290 (1999) | |
| j9 | Mohammad Amin Shokrollahi: Relative class number of imaginary Abelian fields of prime conductor below 10000. Math. Comput. 68(228): 1717-1728 (1999) | |
| j8 | Mohammad Amin Shokrollahi, Hal Wasserman: List Decoding of Algebraic-Geometric Codes. IEEE Transactions on Information Theory 45(2): 432-437 (1999) | |
| c9 | Mohammad Amin Shokrollahi: New Sequences of Linear Time Erasure Codes Approaching the Channel Capacity. AAECC 1999: 65-76 | |
| c8 | Vadim Olshevsky, Mohammad Amin Shokrollahi: A Displacement Approach to Efficient Decoding of Algebraic-Geometric Codes. STOC 1999: 235-244 | |
| 1998 | ||
| c7 | Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi: Analysis of Random Processes via And-Or Tree Evaluation. SODA 1998: 364-373 | |
| c6 | Mohammad Amin Shokrollahi, Hal Wasserman: Decoding Algebraic-Geometric Codes Beyond the Error-Correction Bound. STOC 1998: 241-248 | |
| c5 | Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman: Analysis of Low Density Codes and Improved Designs Using Irregular Graphs. STOC 1998: 249-258 | |
| 1997 | ||
| b1 | Peter Bürgisser, Michael Clausen, Mohammad Amin Shokrollahi: Algebraic complexity theory. Grundlehren der mathematischen Wissenschaften 315, Springer 1997, isbn 3-540-60582-7, pp. I-XXIII, 1-618 | |
| j7 | Mohammad Amin Shokrollahi, Daniel A. Spielman, Volker Stemann: A Remark on Matrix Rigidity. Inf. Process. Lett. 64(6): 283-285 (1997) | |
| j6 | A. Omrani, Amin Shokrollahi: Computing irreducible representations of supersolvable groups over small finite fields. Math. Comput. 66(218): 779-786 (1997) | |
| c4 | Tomas Sander, Mohammad Amin Shokrollahi: Deciding Properties of Polynomials Without Factoring. FOCS 1997: 46-55 | |
| c3 | Joe Buhler, Mohammad Amin Shokrollahi, Volker Stemann: Fast and Precise Computations of Discrete Fourier Transforms Using Cyclotomic Integers. STOC 1997: 40-47 | |
| c2 | Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman, Volker Stemann: Practical Loss-Resilient Codes. STOC 1997: 150-159 | |
| 1996 | ||
| j5 | ||
| 1992 | ||
| j4 | Mohammad Amin Shokrollahi: Efficient Randomized Generation of Optimal Algorithms for Multiplication in Certain Finite Fields. Computational Complexity 2: 67-96 (1992) | |
| j3 | Mohammad Amin Shokrollahi: Optimal Algorithms for Multiplication in Certain Finite Fields Using Elliptic Curves. SIAM J. Comput. 21(6): 1193-1198 (1992) | |
| 1991 | ||
| j2 | Ulrich Baum, Mohammad Amin Shokrollahi: An Optimal Algorithm for Multiplication in F256/F4. Appl. Algebra Eng. Commun. Comput. 2: 15-20 (1991) | |
| j1 | Mohammad Amin Shokrollahi: On the Rank of Certain Finite Fields. Computational Complexity 1: 157-181 (1991) | |
| 1986 | ||
| c1 | ||
Colors in the list of coauthors
Last update Tue May 21 13:09:37 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page