Amin Shokrollahi

According to our database1, Amin Shokrollahi authored at least 94 papers between 1986 and 2020.

Collaborative distances:

Awards

IEEE Fellow

IEEE Fellow 2008, "For contributions to coding theory and practice".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
A 1.02-pJ/b 20.83-Gb/s/Wire USR Transceiver Using CNRZ-5 in 16-nm FinFET.
IEEE J. Solid State Circuits, 2020


2019

2016
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.
Proceedings of the 2016 IEEE International Solid-State Circuits Conference, 2016

2015
Online Fountain Codes With Low Overhead.
IEEE Trans. Inf. Theory, 2015

2014
Nonbinary Associative Memory With Exponential Pattern Retrieval Capacity and Iterative Learning.
IEEE Trans. Neural Networks Learn. Syst., 2014

LDPC Codes for 2D Arrays.
IEEE Trans. Inf. Theory, 2014

Noise Facilitation in Associative Memories of Exponential Capacity.
Neural Comput., 2014

Convolutional Neural Associative Memories: Massive Capacity with Noise Tolerance.
CoRR, 2014

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.
Proceedings of the 2014 IEEE International Conference on Solid-State Circuits Conference, 2014

2013
A Non-Binary Associative Memory with Exponential Pattern Retrieval Capacity and Iterative Learning: Extended Results
CoRR, 2013

Evolving artificial neural network and imperialist competitive algorithm for prediction oil flow rate of the reservoir.
Appl. Soft Comput., 2013

Noise-Enhanced Associative Memories.
Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

Coupled neural associative memories.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

A class of generalized RS-codes with faster encoding and decoding algorithms.
Proceedings of the 2013 Information Theory and Applications Workshop, 2013

Iterative Learning and Denoising in Convolutional Neural Associative Memories.
Proceedings of the 30th International Conference on Machine Learning, 2013

2012
Analysis of the Second Moment of the LT Decoder.
IEEE Trans. Inf. Theory, 2012

Invertible Extractors and Wiretap Protocols.
IEEE Trans. Inf. Theory, 2012

Irregular product codes.
Proceedings of the 2012 IEEE Information Theory Workshop, 2012

2011
RaptorQ Forward Error Correction Scheme for Object Delivery.
RFC, August, 2011

Efficient Implementation of Linear Programming Decoding.
IEEE Trans. Inf. Theory, 2011

Coding Theory (Dagstuhl Seminar 11461).
Dagstuhl Reports, 2011

Exponential pattern retrieval capacity with non-binary associative memory.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

On-line fountain codes for semi-random loss channels.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

Neural pre-coding increases the pattern retrieval capacity of Hopfield and Bidirectional Associative Memories.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Slepian-Wolf type problems on the erasure channel.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Array-code ensembles -or- two-dimensional LDPC codes.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

LT-Codes and Phase Transitions for Mutual Information - (Invited Talk).
Proceedings of the Information Theoretic Security - 5th International Conference, 2011

2009
Raptor Codes.
Found. Trends Commun. Inf. Theory, 2009

Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Bounds on the mutual informations of the binary sums of Bernoulli random variables.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Decoding algorithms for binary Raptor codes over nonbinary channels.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Bit precision analysis for compressed sensing.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
Asymmetric information embedding.
Appl. Algebra Eng. Commun. Comput., 2008

The development of Raptor codes.
Proceedings of the 2008 IEEE Information Theory Workshop, 2008

Fountain codes for piecewise stationary channels.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

08301 Final Report - Group Testing in the Life Sciences.
Proceedings of the Group Testing in the Life Sciences, 20.07. - 25.07.2008, 2008

2007
Raptor Forward Error Correction Scheme for Object Delivery.
RFC, October, 2007

Efficient Multiplication Using Type 2 Optimal Normal Bases.
Proceedings of the Arithmetic of Finite Fields, First International Workshop, 2007

EXIT Functions for LT and Raptor Codes, and Asymptotic Ranks of Random Matrices.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Cryptanalysis of the Sidelnikov Cryptosystem.
Proceedings of the Advances in Cryptology, 2007

2006
Raptor codes.
IEEE Trans. Inf. Theory, 2006

Raptor codes on binary memoryless symmetric channels.
IEEE Trans. Inf. Theory, 2006

Design Principles for Raptor Codes.
Proceedings of the 2006 IEEE Information Theory Workshop, 2006

Some graph products and their expansion properties.
Proceedings of the 2006 IEEE Information Theory Workshop, 2006

New model for rigorous analysis of LT-codes.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Burrows-Wheeler Text Compression with Fountain Codes.
Proceedings of the 2006 Data Compression Conference (DCC 2006), 2006

2005
Optimal regular LDPC codes for the binary erasure channel.
IEEE Commun. Lett., 2005

Coding schemes for line networks.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Verification decoding of raptor codes.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Repeat-accumulate codes that approach the Gilbert-Varshamov bound.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Improved Decoding of Interleaved AG Codes.
Proceedings of the Cryptography and Coding, 2005

2004
Universal variable-length data compression of binary sources using fountain codes.
Proceedings of the 2004 IEEE Information Theory Workshop, 2004

Low-density parity-check codes with rates very close to the capacity of the q-ary symmetric channel for large q.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Finite length analysis of LT codes.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Raptor codes on symmetric channels.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Algebraic-geometric codes on the erasure channel.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Probabilistic decoding of interleaved RS-codes on the q-ary symmetric channel.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003
An authentication scheme based on roots of sparse polynomials.
Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003

Fountain codes for lossless data compression.
Proceedings of the Algebraic Coding Theory and Information Theory, 2003

2002
Computing the performance of unitary space-time group codes from their character table.
IEEE Trans. Inf. Theory, 2002

Capacity-achieving sequences for the erasure channel.
IEEE Trans. Inf. Theory, 2002

2001
Representation theory for high-rate multiple-antenna code design.
IEEE Trans. Inf. Theory, 2001

Design of capacity-approaching irregular low-density parity-check codes.
IEEE Trans. Inf. Theory, 2001

Improved low-density parity-check codes using irregular graphs.
IEEE Trans. Inf. Theory, 2001

Efficient erasure correcting codes.
IEEE Trans. Inf. Theory, 2001

Irregular Primes and Cyclotomic Invariants to 12 Million.
J. Symb. Comput., 2001

Design of Differential Space-Time Codes Using Group Theory.
Proceedings of the Applied Algebra, 2001

2000
Fast and precise Fourier transforms.
IEEE Trans. Inf. Theory, 2000

Codes for differential signaling with many antennas.
Proceedings of the 2000 IEEE Wireless Communications and Networking Conference, 2000

Matrix-vector product for confluent Cauchy-like matrices with application to confluent rational interpolation.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Codes and Graphs.
Proceedings of the STACS 2000, 2000

An Introduction to Low-Density Parity-Check Codes.
Proceedings of the Theoretical Aspects of Computer Science, 2000

1999
List Decoding of Algebraic-Geometric Codes.
IEEE Trans. Inf. Theory, 1999

Relative class number of imaginary Abelian fields of prime conductor below 10000.
Math. Comput., 1999

Normal bases via general Gauss periods.
Math. Comput., 1999

A Displacement Approach to Efficient Decoding of Algebraic-Geometric Codes.
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

New Sequences of Linear Time Erasure Codes Approaching the Channel Capacity.
Proceedings of the Applied Algebra, 1999

1998
Decoding Algebraic-Geometric Codes Beyond the Error-Correction Bound.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Analysis of Low Density Codes and Improved Designs Using Irregular Graphs.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Analysis of Random Processes via And-Or Tree Evaluation.
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

1997
Computing irreducible representations of supersolvable groups over small finite fields.
Math. Comput., 1997

A Remark on Matrix Rigidity.
Inf. Process. Lett., 1997

Practical Loss-Resilient Codes.
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

Fast and Precise Computations of Discrete Fourier Transforms Using Cyclotomic Integers.
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

Deciding Properties of Polynomials Without Factoring.
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

Algebraic complexity theory.
Grundlehren der mathematischen Wissenschaften 315, Springer, ISBN: 3-540-60582-7, 1997

1996
Stickelberger Codes.
Des. Codes Cryptogr., 1996

1992
Optimal Algorithms for Multiplication in Certain Finite Fields Using Elliptic Curves.
SIAM J. Comput., 1992

Efficient Randomized Generation of Optimal Algorithms for Multiplication in Certain Finite Fields.
Comput. Complex., 1992

1991
Beiträge zur Codierungs- und Komplexitätstheorie mittels algebraischer Funktionenkörper.
PhD thesis, 1991

On the Rank of Certain Finite Fields.
Comput. Complex., 1991

An Optimal Algorithm for Multiplication in F256/F4.
Appl. Algebra Eng. Commun. Comput., 1991

1986
Codes on Hermitian Curves.
Proceedings of the Applied Algebra, 1986


  Loading...