default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmin Shokrollahi 0001
Mohammad Amin Shokrollahi
Person information
- affiliation: Kandou Bus, Lausanne, Switzerland
- affiliation (since 2003): EPFL, Faculty of Basic Sciences, Lausanne, Switzerland
- affiliation (2000 - 2009): Digital Fountain, Inc., Fremont, CA, USA
- affiliation (1998 - 2000): Bell Laboratories, Lucent Technologies, Inc., Department of Fundamental Mathematics, Murray Hill, NJ, USA
- affiliation (1995 - 1998): University of California, Berkeley, International Computer Science Institute, CA, USA
- affiliation (PhD 1991): University of Bonn, Institute of Computer Science, Germany
- award (2012): IEEE Richard W. Hamming Medal
Other persons with the same name
- Amin Shokrollahi 0002
![[0000-0001-7938-7022]](https://devdomain4test.ir/img/orcid-mark.12x12.png "0000-0001-7938-7022")
— University of Adelaide, SA, Australia (and 2 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2020 – today
- 2025
[c61]Armin Tajalli, Cosimo Aprile, Milad Ataei, Rolf Beerwerth, Dario Carneli, Maik Fuhs, Kiarash Gharibdoust, Ali Hormati, James Hudner, Victor Perrin, Amin Shokrollahi, Richard Simpson, Andrew Stewart, David Stauffer, Giuseppe Surace, Roger Ulrich, Patrick Urban, Mark Venneborger, Anant Singh:
A 16nm 140-fJ/b/dB Dual-Mode ENRZ/NRZ Serial Data Transceiver with Dynamic Voltage Scaling. CICC 2025: 1-3- 2022
- [c60]Armin Tajalli, Amin Shokrollahi:
Balanced Circuit Topologies and Their Applications in Data Movement. MWSCAS 2022: 1-6 - 2020
- [j31]Armin Tajalli, Mani Bastani Parizi, Dario Albino Carnelli, Chen Cao, Kiarash Gharibdoust, Davide Gorret, Amit Gupta, Christopher Hall, Ahmed Hassanin, Klaas L. Hofstra, Brian Holden, Ali Hormati, John Keay, Yohann Mogentale, Victor Perrin, John Phillips, Sumathi Raparthy, Amin Shokrollahi, David Stauffer, Richard Simpson, Andrew Stewart, Giuseppe Surace, Omid Talebi Amiri, Emanuele Truffa, Anton Tschank, Roger Ulrich, Christoph Walter, Anant Singh:
A 1.02-pJ/b 20.83-Gb/s/Wire USR Transceiver Using CNRZ-5 in 16-nm FinFET. IEEE J. Solid State Circuits 55(4): 1108-1123 (2020) - [c59]Armin Tajalli, Mani Bastani Parizi, Dario Albino Carnelli, Chen Cao, Kiarash Gharibdoust, Amit Gupta, Ahmed Hassanin, Klaas L. Hofstra, Brian Holden, Ali Hormati, John Keay, Amin Shokrollahi, David Stauffer, Richard Simpson, Andrew Stewart, Giuseppe Surace, Omid Talebi Amiri, Anton Tschank, Roger Ulrich, Christoph Walter, Anant Singh:
Short-Reach and Pin-Efficient Interfaces Using Correlated NRZ. CICC 2020: 1-8
2010 – 2019
- 2019
- [c58]Armin Tajalli, Mani Bastani Parizi, Dario Albino Carnelli, Chen Cao, John Fox, Kiarash Gharibdoust, Davide Gorret, Amit Gupta, Christopher Hall, Ahmed Hassanin, Klaas L. Hofstra, Brian Holden, Ali Hormati, John Keay, Yohann Mogentale, G. Paul, Victor Perrin, John Phillips, Sumathi Raparthy, Amin Shokrollahi, David Stauffer, Richard Simpson, Andrew Stewart, Giuseppe Surace, Omid Talebi Amiri, Emanuele Truffa, Anton Tschank, Roger Ulrich, Christoph Walter, Anant Singh:
A 1.02pJ/b 417Gb/s/mm USR Link in 16nm FinFET. VLSI Circuits 2019: 92- - 2016
- [c57]Amin Shokrollahi, Dario Albino Carnelli, John Fox, Klaas L. Hofstra, Brian Holden, Ali Hormati, Peter Hunt, Margaret Johnston, John Keay, Sergio Pesenti, Richard Simpson, David Stauffer, Andrew Stewart, Giuseppe Surace, Armin Tajalli, Omid Talebi Amiri, Anton Tschank, Roger Ulrich, Christoph Walter, Fabio Licciardello, Yohann Mogentale, Anant Singh:
10.1 A pin-efficient 20.83Gb/s/wire 0.94pJ/bit forwarded clock CNRZ-5-coded SerDes up to 12mm for MCM packages in 28nm CMOS. ISSCC 2016: 182-183 - 2015
- [j30]Yuval Cassuto, Amin Shokrollahi:
Online Fountain Codes With Low Overhead. IEEE Trans. Inf. Theory 61(6): 3137-3149 (2015) - 2014
- [j29]Amin Karbasi, Amir Hesam Salavati, Amin Shokrollahi, Lav R. Varshney:
Noise Facilitation in Associative Memories of Exponential Capacity. Neural Comput. 26(11): 2493-2526 (2014) - [j28]Yuval Cassuto, Amin Shokrollahi:
LDPC Codes for 2D Arrays. IEEE Trans. Inf. Theory 60(6): 3279-3291 (2014) - [j27]Amir Hesam Salavati, K. Raj Kumar, Amin Shokrollahi:
Nonbinary Associative Memory With Exponential Pattern Retrieval Capacity and Iterative Learning. IEEE Trans. Neural Networks Learn. Syst. 25(3): 557-570 (2014) - [c56]Anant Singh, Dario Albino Carnelli, Altay Falay, Klaas L. Hofstra, Fabio Licciardello, Kia Salimi, Hugo Santos, Amin Shokrollahi, Roger Ulrich, Christoph Walter, John Fox, Peter Hunt, John Keay, Richard Simpson, Andrew Stewart, Giuseppe Surace, Harm S. Cronie:
26.3 A pin- and power-efficient low-latency 8-to-12Gb/s/wire 8b8w-coded SerDes link for high-loss channels in 40nm technology. ISSCC 2014: 442-443 - [i16]Amin Karbasi, Amir Hesam Salavati, Amin Shokrollahi, Lav R. Varshney:
Noise Facilitation in Associative Memories of Exponential Capacity. CoRR abs/1403.3305 (2014) - [i15]Amin Karbasi, Amir Hesam Salavati, Amin Shokrollahi:
Convolutional Neural Associative Memories: Massive Capacity with Noise Tolerance. CoRR abs/1407.6513 (2014) - 2013
- [c55]Amin Karbasi, Amir Hesam Salavati, Amin Shokrollahi:
Iterative Learning and Denoising in Convolutional Neural Associative Memories. ICML (1) 2013: 445-453 - [c54]Amin Shokrollahi:
A class of generalized RS-codes with faster encoding and decoding algorithms. ITA 2013: 1-10 - [c53]Amin Karbasi, Amir Hesam Salavati, Amin Shokrollahi:
Coupled neural associative memories. ITW 2013: 1-5 - [c52]Amin Karbasi, Amir Hesam Salavati, Amin Shokrollahi, Lav R. Varshney:
Noise-Enhanced Associative Memories. NIPS 2013: 1682-1690 - [i14]Amin Karbasi, Amir Hesam Salavati, Amin Shokrollahi:
Coupled Neural Associative Memories. CoRR abs/1301.1555 (2013) - [i13]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 Trans. Inf. Theory 58(2): 1254-1274 (2012) - [j25]Ghid Maatouk, Amin Shokrollahi:
Analysis of the Second Moment of the LT Decoder. IEEE Trans. Inf. Theory 58(5): 2558-2569 (2012) - [c51]Masoud Alipour, Omid Etesami, Ghid Maatouk, Amin Shokrollahi:
Irregular product codes. ITW 2012: 197-201 - [i12]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 Trans. Inf. Theory 57(9): 5960-5982 (2011) - [c50]Amin Shokrollahi:
LT-Codes and Phase Transitions for Mutual Information - (Invited Talk). ICITS 2011: 94-99 - [c49]Yuval Cassuto, Mohammad Amin Shokrollahi:
Array-code ensembles -or- two-dimensional LDPC codes. ISIT 2011: 518-522 - [c48]Amir Hesam Salavati, K. Raj Kumar, Mohammad Amin Shokrollahi, Wulfram Gerstner:
Neural pre-coding increases the pattern retrieval capacity of Hopfield and Bidirectional Associative Memories. ISIT 2011: 850-854 - [c47]Michael Luby, Mohammad Amin Shokrollahi:
Slepian-Wolf type problems on the erasure channel. ISIT 2011: 2771-2775 - [c46]K. Raj Kumar, Amir Hesam Salavati, Amin Shokrollahi:
Exponential pattern retrieval capacity with non-binary associative memory. ITW 2011: 80-84 - [c45]Yuval Cassuto, Amin Shokrollahi:
On-line fountain codes for semi-random loss channels. ITW 2011: 262-266 - [i11]Joachim Rosenthal, Mohammad Amin Shokrollahi, Judy L. Walker:
Coding Theory (Dagstuhl Seminar 11461). Dagstuhl Reports 1(11): 50-65 (2011) - [i10]Michael Luby, Amin Shokrollahi, Mark Watson, Thomas Stockhammer, Lorenz Minder:
RaptorQ Forward Error Correction Scheme for Object Delivery. RFC 6330: 1-69 (2011)
2000 – 2009
- 2009
- [j23]Mohammad Amin Shokrollahi, Michael Luby:
Raptor Codes. Found. Trends Commun. Inf. Theory 6(3-4): 213-322 (2009) - [c44]Ehsan Ardestanizadeh, Mahdi Cheraghchi, Amin Shokrollahi:
Bit precision analysis for compressed sensing. ISIT 2009: 1-5 - [c43]Payam Pakzad, Venkat Anantharam, Amin Shokrollahi:
Bounds on the mutual informations of the binary sums of Bernoulli random variables. ISIT 2009: 304-308 - [c42]Mahdi Cheraghchi, Frédéric Didier, Amin Shokrollahi:
Invertible extractors and wiretap protocols. ISIT 2009: 1934-1938 - [c41]Ghid Maatouk, Amin Shokrollahi:
Analysis of the second moment of the LT decoder. ISIT 2009: 2326-2330 - [c40]Harm S. Cronie, Bertrand Ndzana Ndzana, Amin Shokrollahi:
Decoding algorithms for binary Raptor codes over nonbinary channels. ISIT 2009: 2487-2491 - [c39]Mahdi Cheraghchi, Amin Shokrollahi:
Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties. STACS 2009: 277-288 - [i9]Mahdi Cheraghchi, Frédéric Didier, Amin Shokrollahi:
Invertible Extractors and Wiretap Protocols. CoRR abs/0901.2120 (2009) - [i8]Ehsan Ardestanizadeh, Mahdi Cheraghchi, Amin Shokrollahi:
Bit Precision Analysis for Compressed Sensing. CoRR abs/0901.2147 (2009) - [i7]Mohammad H. Taghavi, Amin Shokrollahi, Paul H. Siegel:
Efficient implementation of linear programming decoding. CoRR abs/0902.0657 (2009) - [i6]Mahdi Cheraghchi, Amin Shokrollahi:
Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties. CoRR abs/0902.1254 (2009) - [i5]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) - [c38]Mohammad H. Taghavi, Amin Shokrollahi, Paul H. Siegel:
Efficient implementation of linear programming decoding. Allerton 2008: 402-409 - [c37]Bertrand Ndzana Ndzana, Andrew W. Eckford, Amin Shokrollahi, Gil I. Shamir:
Fountain codes for piecewise stationary channels. ISIT 2008: 2242-2246 - [c36]Amin Shokrollahi:
The development of Raptor codes. ITW 2008: 219 - [e2]Alexander Schliep, Amin Shokrollahi, Nicolas Thierry-Mieg:
Group Testing in the Life Sciences, 20.07. - 25.07.2008. Dagstuhl Seminar Proceedings 08301, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2008 [contents] - [i4]Alexander Schliep, Nicolas Thierry-Mieg, Amin Shokrollahi:
08301 Final Report - Group Testing in the Life Sciences. Group Testing in the Life Sciences 2008 - 2007
- [c35]Lorenz Minder, Amin Shokrollahi:
Cryptanalysis of the Sidelnikov Cryptosystem. EUROCRYPT 2007: 347-360 - [c34]Payam Pakzad, Amin Shokrollahi:
EXIT Functions for LT and Raptor Codes, and Asymptotic Ranks of Random Matrices. ISIT 2007: 411-415 - [c33]Amin Shokrollahi:
Raptor Codes. ITW 2007: 1 - [c32]Joachim von zur Gathen, Amin Shokrollahi, Jamshid Shokrollahi:
Efficient Multiplication Using Type 2 Optimal Normal Bases. WAIFI 2007: 55-68 - [i3]Michael Luby, Amin Shokrollahi, Mark Watson, Thomas Stockhammer:
Raptor Forward Error Correction Scheme for Object Delivery. RFC 5053: 1-46 (2007) - 2006
- [j21]Omid Etesami, Amin Shokrollahi:
Raptor codes on binary memoryless symmetric channels. IEEE Trans. Inf. Theory 52(5): 2033-2051 (2006) - [j20]Amin Shokrollahi:
Raptor codes. IEEE Trans. Inf. Theory 52(6): 2551-2567 (2006) - [c31]Bertrand Ndzana Ndzana, Amin Shokrollahi, Jürgen Abel:
Burrows-Wheeler Text Compression with Fountain Codes. DCC 2006: 462 - [c30]Elitza N. Maneva, Amin Shokrollahi:
New model for rigorous analysis of LT-codes. ISIT 2006: 2677-2679 - [c29]Payam Pakzad, Amin Shokrollahi:
Design Principles for Raptor Codes. ITW 2006: 165-169 - [c28]Andrew Brown, Amin Shokrollahi:
Some graph products and their expansion properties. ITW 2006: 170-174 - 2005
- [j19]Mahmoud Rashidpour, Amin Shokrollahi, Seyed Hamaidreza Jamali:
Optimal regular LDPC codes for the binary erasure channel. IEEE Commun. Lett. 9(6): 546-548 (2005) - [c27]Andrew Brown, Lorenz Minder, Amin Shokrollahi:
Improved Decoding of Interleaved AG Codes. IMACC 2005: 37-46 - [c26]Andrew Brown, Michael Luby, Amin Shokrollahi:
Repeat-accumulate codes that approach the Gilbert-Varshamov bound. ISIT 2005: 169-173 - [c25]Richard M. Karp, Michael Luby, Amin Shokrollahi:
Verification decoding of raptor codes. ISIT 2005: 1310-1314 - [c24]Payam Pakzad, Christina Fragouli, Amin Shokrollahi:
Coding schemes for line networks. ISIT 2005: 1853-1857 - [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) - 2004
- [c23]Amin Shokrollahi:
Raptor codes. ISIT 2004: 36 - [c22]Omid Etesami, Mehdi Molkaraie, Amin Shokrollahi:
Raptor codes on symmetric channels. ISIT 2004: 38 - [c21]Richard M. Karp, Michael Luby, Amin Shokrollahi:
Finite length analysis of LT codes. ISIT 2004: 39 - [c20]Andrew Brown, Amin Shokrollahi:
Algebraic-geometric codes on the erasure channel. ISIT 2004: 76 - [c19]Amin Shokrollahi, Wei Wang:
Low-density parity-check codes with rates very close to the capacity of the q-ary symmetric channel for large q. ISIT 2004: 275 - [c18]Andrew Brown, Lorenz Minder, Amin Shokrollahi:
Probabilistic decoding of interleaved RS-codes on the q-ary symmetric channel. ISIT 2004: 327 - [c17]Giuseppe Caire, Shlomo Shamai, Amin Shokrollahi, Sergio Verdú:
Universal variable-length data compression of binary sources using fountain codes. ITW 2004: 123-128 - 2003
- [c16]Giuseppe Caire, Shlomo Shamai, Amin Shokrollahi, Sergio Verdú:
Fountain codes for lossless data compression. Algebraic Coding Theory and Information Theory 2003: 1-20 - [c15]Joachim von zur Gathen, Amin Shokrollahi, Igor E. Shparlinski:
An authentication scheme based on roots of sparse polynomials. ITW 2003: 159-162 - 2002
- [j18]Mohammad Amin Shokrollahi:
Computing the performance of unitary space-time group codes from their character table. IEEE Trans. Inf. Theory 48(6): 1355-1371 (2002) - [j17]Peter Oswald, Amin Shokrollahi:
Capacity-achieving sequences for the erasure channel. IEEE Trans. Inf. Theory 48(12): 3017-3028 (2002) - [e1]Gholamreza B. Khosrovshahi, Ali Shokoufandeh, Mohammad Amin Shokrollahi:
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 [contents] - 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 Trans. Inf. 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 Trans. Inf. 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 Trans. Inf. 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 Trans. Inf. Theory 47(6): 2335-2367 (2001) - [c14]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 Trans. Inf. Theory 46(1): 213-228 (2000) - [c13]Mohammad Amin Shokrollahi:
An Introduction to Low-Density Parity-Check Codes. Theoretical Aspects of Computer Science 2000: 175-197 - [c12]Mohammad Amin Shokrollahi:
Codes and Graphs. STACS 2000: 1-12 - [c11]Vadim Olshevsky, Mohammad Amin Shokrollahi:
Matrix-vector product for confluent Cauchy-like matrices with application to confluent rational interpolation. STOC 2000: 573-581 - [c10]Babak Hassibi, Bertrand M. Hochwald, Amin Shokrollahi, Wim Sweldens:
Codes for differential signaling with many antennas. WCNC 2000: 23-24
1990 – 1999
- 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 Trans. Inf. 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
- [b2]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]Mohammad Amin Shokrollahi:
Stickelberger Codes. Des. Codes Cryptogr. 9(2): 203-213 (1996) - 1992
- [j4]Mohammad Amin Shokrollahi:
Efficient Randomized Generation of Optimal Algorithms for Multiplication in Certain Finite Fields. Comput. Complex. 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
- [b1]Mohammad Amin Shokrollahi:
Beiträge zur Codierungs- und Komplexitätstheorie mittels algebraischer Funktionenkörper. University of Bonn, Germany, 1991, pp. 1-236 - [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. Comput. Complex. 1: 157-181 (1991)
1980 – 1989
- 1986
- [c1]Mohammad Amin Shokrollahi:
Codes on Hermitian Curves. AAECC 1986: 168-176
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-04-04 00:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
