Publications associées à Array-Code Ensembles -or- Two-Dimensional LDPC Codes

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

LDPC Codes for 2D Arrays

Mohammad Amin Shokrollahi, Yuval Cassuto

Binary codes over 2D arrays are very useful in data storage, where each array column represents a storage device or unit that may suffer failure. In this paper, we propose a new framework for probabilistic construction of codes on 2D arrays. Instead of a p ...

Institute of Electrical and Electronics Engineers2014

Linear Programming Decoding of Spatially Coupled Codes

Rüdiger Urbanke, Badih Ghazi

For a given family of spatially coupled codes, we prove that the linear programming (LP) threshold on the binary-symmetric channel (BSC) of the tail-biting graph cover ensemble is the same as the LP threshold on the BSC of the derived spatially coupled ens ...

Ieee-Inst Electrical Electronics Engineers Inc2014

The terms of turbulent kinetic energy budget within random arrays of emergent cylinders

Anton Schleiss, Mário Jorge Rodrigues Pereira Da Franca, Ana Margarida Da Costa Ricardo

This article is aimed at quantifying and discussing the relative magnitude of key terms of the equation of conservation of turbulent kinetic energy (TKE) in the inter-stem space of a flow within arrays of vertical cylinders simulating plant stems of emerge ...

American Geophysical Union2014

Scaling Exponent of List Decoders with Applications to Polar Codes

Rüdiger Urbanke, Seyed Hamed Hassani, Marco Mondelli

Motivated by the significant performance gains which polar codes experience when they are decoded with successive cancellation list decoders, we study how the scaling exponent changes as a function of the list size L. In particular, we fix the block error ...

Ieee2013

Synthesis of uniform amplitude focused beam arrays

Juan Ramon Mosig, Anja Skrivervik, Benjamin Fuchs

An iterative procedure for the synthesis of uniform amplitude focused beam arrays is presented. Specifically, the goal is to optimize the locations of a fixed number of array elements with known excitations in order to synthesize narrow-beam low-sidelobe p ...

2012

Irregular Product Codes

Mohammad Amin Shokrollahi, Ghid Maatouk, Seyed Omid Etesami, Masoud Alipour Babaei

We introduce irregular product codes, a class of codes where each codeword is represented by a matrix and the entries in each row (column) of the matrix come from a component row (column) code. As opposed to standard product codes, we do not require that a ...

Ieee2012

On the scaling of polar codes: II. The behavior of un-polarized channels

Rüdiger Urbanke, Seyed Hamed Hassani

We provide upper and lower bounds on the escape rate of the Bhattacharyya process corresponding to polar codes where transmission takes place over the the binary erasure channel. More precisely, we bound the exponent of the number of sub-channels whose Bha ...

IEEE2010

A union of incoherent spaces model for classification

Pierre Vandergheynst, Karin Schnass

We present a new and computationally efficient scheme for classifying signals into a fixed number of known classes. We model classes as subspaces in which the corresponding data is well represented by a dictionary of features. In order to ensure low miscla ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

Demosaicking by Alternating Projections: Theory and Fast One-Step Implementation

Martin Vetterli, Yue Lu, Mina Karzand

Color image demosaicking is a key process in the digital imaging pipeline. In this paper, we study a well-known and influential demosaicking algorithm based on alternating projections (AP), proposed by Gunturk, Altunbasak and Mersereau in 2002. Since its p ...

Institute of Electrical and Electronics Engineers2010

Array-Code Ensembles -or- Two-Dimensional LDPC Codes

Graph Chatbot

Chattez avec Graph Search

LDPC Codes for 2D Arrays

Linear Programming Decoding of Spatially Coupled Codes

The terms of turbulent kinetic energy budget within random arrays of emergent cylinders

Scaling Exponent of List Decoders with Applications to Polar Codes

Synthesis of uniform amplitude focused beam arrays

Irregular Product Codes

RRB-Trees: Efficient Immutable Vectors

On the scaling of polar codes: II. The behavior of un-polarized channels

A union of incoherent spaces model for classification

Demosaicking by Alternating Projections: Theory and Fast One-Step Implementation

LDPC Codes for 2D Arrays

The terms of turbulent kinetic energy budget within random arrays of emergent cylinders

Synthesis of uniform amplitude focused beam arrays

Irregular Product Codes

RRB-Trees: Efficient Immutable Vectors

Linear Programming Decoding of Spatially Coupled Codes

On the scaling of polar codes: II. The behavior of un-polarized channels

Scaling Exponent of List Decoders with Applications to Polar Codes

A union of incoherent spaces model for classification

Demosaicking by Alternating Projections: Theory and Fast One-Step Implementation