Home

Person

Mohammad Amin Shokrollahi

About
Privacy
Disclaimer

Graph Chatbot

Related publications (58)

Fountain Codes for the Slepian-Wolf Problem

Bertrand Ndzana Ndzana, Mohammad Amin Shokrollahi

In this paper, we describe one solution to the two-user Slepian-Wolf problem in a certain part of the achievable region using fountain codes. Symmetric case of memoryless compression of two correlated sources is considered and modeled by a BSC channel. The ...

2006

New model for rigorous analysis of LT-codes

Mohammad Amin Shokrollahi

We present a new model for LT codes which simplifies the analysis of the error probability of decoding by belief propagation. For any given degree distribution, we provide the first rigorous expression for the limiting bit-error probability as the length o ...

2006

Multi-stage code generator and decoder for communication systems

Mohammad Amin Shokrollahi

A method of encoding data for transmission from a source to a destination over a communications channel is provided. A plurality of redundant symbols are generated from an ordered set of input symbols to be transmitted. A plurality of output symbols are ge ...

2006

Computational Hardness and Explicit Constructions of Error Correcting Codes

Mohammad Amin Shokrollahi, Mahdi Cheraghchi Bashi Astaneh

We outline a procedure for using pseudorandom generators to construct binary codes with good properties, assuming the existence of sufficiently hard functions. Specifically, we give a polynomial time algorithm, which for every integers

n

and

k

, constru ...

2006

Systems and methods for broadcasting information additive codes

Mohammad Amin Shokrollahi

A broadcasting system for communicating data to multiple receivers using information additive code includes one or more information additive code transmitters (110) and one or more information additive code receivers (130). Each of the information additive ...

2006

Decoding of chain reaction codes through inactivation of recovered symbols

Mohammad Amin Shokrollahi

A method for processing a chain reaction codes includes first selecting a source symbol which is associated an output symbol of degree two or higher (i.e., an output symbol which is itself associated with two or more input symbols), recovering the value of ...

2006

Verification decoding of raptor codes

Mohammad Amin Shokrollahi

2006

Design Principles for Raptor Codes

Mohammad Amin Shokrollahi

In this paper we describe some practical aspects of the design process of good Raptor codes for finite block lengths over arbitrary binary input symmetric channels. In particular we introduce a simple model for the finite-length convergence behavior of the ...

2006

Raptor Codes

Mohammad Amin Shokrollahi

LT-codes are a new class of codes introduced by Luby for the purpose of scalable and fault-tolerant distribution of data over computer networks. In this paper, we introduce Raptor codes, an extension of LT-codes with linear time encoding and decoding. We w ...

2006

Burrows-Wheeler text compression with fountain codes

Bertrand Ndzana Ndzana, Mohammad Amin Shokrollahi

This paper presents an algorithm in a purely lossless text compression setting based on fountain codes and the Burrows-Wheeler transform (BWT). The scheme consists of five stages, each of which is briefly described in the paper. The algorithm offers encour ...

2006

Raptor Codes on Binary Memoryless Symmetric Channels

Mohammad Amin Shokrollahi, Seyed Omid Etesami

In this paper, we will investigate the performance of Raptor codes on arbitrary binary input memoryless symmetric channels (BIMSCs). In doing so, we generalize some of the results that were proved before for the erasure channel. We will generalize the stab ...

2006

Forward error-correcting (FEC) coding and streaming

Mohammad Amin Shokrollahi

In a data decoder for decoding data from received symbols received over a channel from an encoder, a method for decoding data wherein the received data includes erasures and includes source symbols and repair symbols organized into one or more source block ...

2006

Some graph products and their expansion properties

Mohammad Amin Shokrollahi, Andrew Brown

We introduce "derandomized" versions of the tensor product and the zig-zag product, extending the ideas in the derandomized squaring operation of Rozenman and Vadhan. These enable us to obtain graphs with smaller degrees than those obtained using their non ...

2006

Coding Schemes for Line Networks

Mohammad Amin Shokrollahi, Christina Fragouli

We consider a simple network, where a source and destination node are connected with a line of erasure channels. It is well known that in order to achieve the min-cut capacity, the intermediate nodes are required to process the information. We propose codi ...

2005

Improved Decoding of Interleaved AG-Codes

Lorenz Minder, Mohammad Amin Shokrollahi, Andrew Brown

We analyze a generalization of a recent algorithm of Bleichenbacher et al.~for decoding interleaved codes on the

Q

-ary symmetric channel for large

Q

. We will show that for any

m

and any

\epsilon

the new algorithms can decode up to a fraction of at ...

2005

Systematic encoding and decoding of chain reaction codes

Mohammad Amin Shokrollahi

A method of encoding data into a chain reaction code includes generating a set of input symbols from input data. Subsequently, one or more non-systematic output symbols is generated from the set of input symbols, each of the one or more non-systematic outp ...

2005

Repeat-accumulate codes that approach the Gilbert-Varshamov bound

Mohammad Amin Shokrollahi, Andrew Brown

2005

Optimal regular LDPC codes for the binary erasure channel

Mohammad Amin Shokrollahi

We prove that for any given R between 0 and 1 the best threshold value for a regular LDPC code of rate R with common variable degree v and common check degree c occurs when v is at least 3 and is minimal subject to the condition

R=1-v/c

...

2005

Page 3 of 3