Concept

Code de Hadamard

Publications associées (90)

Graph Chatbot

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.

Connectez-vous pour utiliser Chat avec Graph Search

Crossbar switch decoder for vector signaling codes

Mohammad Amin Shokrollahi

An efficient decoding of vector signaling codes is obtained using a circuit that ranks received signal levels, designates ranked values as representing particular code elements, and translates those particular code elements into a decoded result. An optimi ...

2012

Non-coherent Network Coding: An Arbitrarily Varying Channel Approach

Mahdi Jafari Siavoshani

In this paper, we propose an “arbitrarily varying channel” (AVC) approach to study the capacity of non-coherent transmission in a network that employs randomized linear network coding. The network operation is modeled by a matrix channel over a ﬁnite ﬁeld ...

2012

Non-coherent Network Coding: An Arbitrarily Varying Channel Approach

Mahdi Jafari Siavoshani

In this paper, we propose an "arbitrarily varying channel" (AVC) approach to study the capacity of non-coherent transmission in a network that employs randomized linear network coding. The network operation is modeled by a matrix channel over a finite fiel ...

Ieee2012

Toward one Symbol Network Coding Vectors

Pascal Frossard, Nikolaos Thomos

In this paper, we propose a novel design for network coding vectors that limits the overhead information. Network coding vectors contain information regarding the operations the packets have undergone in the network nodes. They are used at the decoder side ...

Institute of Electrical and Electronics Engineers2012

Subspace properties of network coding and their applications

Christina Fragouli, Suhas Diggavi, Mahdi Jafari Siavoshani

Systems that employ network coding for content distribution convey to the receivers linear combinations of the source packets. If we assume randomized network coding, during this process the network nodes collect random subspaces of the space spanned by th ...

2012

Algebraic Algorithms for Vector Network Coding

Christina Fragouli, Javad Ebrahimi Boroojeni

We develop new algebraic algorithms for scalar and vector network coding. In vector network coding, the source multicasts information by transmitting vectors of length L, while intermediate nodes process and combine their incoming packets by multiplying th ...

Institute of Electrical and Electronics Engineers2011

Universal Rateless Codes From Coupled LT Codes

Rüdiger Urbanke, Vahid Aref

It was recently shown that spatial coupling of individual low-density parity-check codes improves the belief-propagation threshold of the coupled ensemble essentially to the maximum a posteriori threshold of the underlying ensemble. We study the performanc ...

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

Encoding and decoding of information

Henry Markram

Method and system for weighting the amplitude of an event in a time -based code. The time-based code is divided into time intervals. Each of the time intervals of the time-based code corresponds to a digit in the received signal. Each digit of a first stat ...

2011

A 15.8 pJ/bit/iter quasi-cyclic LDPC decoder for IEEE 802.11n in 90 nm CMOS

Andreas Peter Burg, Pascal Andreas Meinerzhagen, Christoph Studer

We present a low-power quasi-cyclic (QC) low density parity check (LDPC) decoder that meets the throughput requirements of the highest-rate (600 Mbps) modes of the IEEE 802.11n WLAN standard. The design is based on the layered offset-min-sum algorithm and ...

IEEE2010

Phase Transitions for Mutual Information

Mohammad Amin Shokrollahi, Krishna Kumar, Amir Hesam Salavati, Raj Kumar Krishna Kumar

We consider ensembles of binary linear error correcting codes, obtained by sampling each column of the generator matrix G or parity check matrix H independently from the set of all binary vectors of weight d (of appropriate dimension). We investigate the c ...

IEEE2010