UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Subspace Pursuit for Compressive Sensing Signal Reconstruction

IEEE transactions on information theory, 2009-05, Vol.55 (5), p.2230-2249

2009

Volltextzugriff (PDF)

Error-Correction in Flash Memories via Codes in the Ulam Metric

IEEE transactions on information theory, 2013-05, Vol.59 (5), p.3003-3020

2013

Volltextzugriff (PDF)

Combinatorial constructions of low-density parity-check codes for iterative decoding

IEEE transactions on information theory, 2004-06, Vol.50 (6), p.1156-1176

2004

Volltextzugriff (PDF)

On the Hardness of Approximating Stopping and Trapping Sets

IEEE transactions on information theory, 2010-04, Vol.56 (4), p.1640-1650

2010

Volltextzugriff (PDF)

A Geometric Approach to Low-Rank Matrix Completion

IEEE transactions on information theory, 2012-01, Vol.58 (1), p.237-247

2012

Volltextzugriff (PDF)

Asymptotic Spectra of Trapping Sets in Regular and Irregular LDPC Code Ensembles

IEEE transactions on information theory, 2007-01, Vol.53 (1), p.39-55

2007

Volltextzugriff (PDF)

Sorting of Permutations by Cost-Constrained Transpositions

IEEE transactions on information theory, 2012-01, Vol.58 (1), p.3-23

2012

Volltextzugriff (PDF)

Weighted Superimposed Codes and Constrained Integer Compressed Sensing

IEEE transactions on information theory, 2009-05, Vol.55 (5), p.2215-2229

2009

Volltextzugriff (PDF)

Generalized low-density parity-check codes for optical communication systems

Journal of lightwave technology, 2005-05, Vol.23 (5), p.1939-1946

2005

Volltextzugriff (PDF)

LDPC Codes Based on Latin Squares: Cycle Structure, Stopping Set, and Trapping Set Analysis

IEEE transactions on communications, 2007-02, Vol.55 (2), p.303-312

2007

Volltextzugriff (PDF)

On unequal error protection LDPC codes based on plotkin-type constructions

IEEE transactions on communications, 2006-06, Vol.54 (6), p.994-1005

2006

Volltextzugriff (PDF)

Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes

IEEE transactions on information theory, 2008-12, Vol.54 (12), p.5308-5331

2008

Volltextzugriff (PDF)

Block-circulant low-density parity-check codes for optical communication systems

IEEE journal of selected topics in quantum electronics, 2004-03, Vol.10 (2), p.294-299

2004

Volltextzugriff (PDF)

The Trapping Redundancy of Linear Block Codes

IEEE transactions on information theory, 2009-01, Vol.55 (1), p.53-63

2009

Volltextzugriff (PDF)

Semiquantitative Group Testing

IEEE transactions on information theory, 2014-08, Vol.60 (8), p.4614-4636

2014

Volltextzugriff (PDF)

Information Theoretical and Algorithmic Approaches to Quantized Compressive Sensing

IEEE transactions on communications, 2011-07, Vol.59 (7), p.1857-1866

2011

Volltextzugriff (PDF)

On graphical representations of algebraic codes suitable for iterative decoding

IEEE communications letters, 2005-08, Vol.9 (8), p.729-731

2005

Volltextzugriff (PDF)

Subspace Evolution and Transfer (SET) for Low-Rank Matrix Completion

IEEE transactions on signal processing, 2011-07, Vol.59 (7), p.3120-3132

2011

Volltextzugriff (PDF)

Code Construction and Decoding Algorithms for Semi-Quantitative Group Testing With Nonuniform Thresholds

IEEE transactions on information theory, 2016-04, Vol.62 (4), p.1674-1687

2016

Volltextzugriff (PDF)

An Axiomatic Approach to Constructing Distances for Rank Comparison and Aggregation

IEEE transactions on information theory, 2014-10, Vol.60 (10), p.6417-6439

2014

Volltextzugriff (PDF)

Probabilistic Transforms for Combinatorial Urn Models

Combinatorics, probability & computing, 2004-07, Vol.13 (4-5), p.645-675

2004

Volltextzugriff (PDF)

Set-Codes with Small Intersections and Small Discrepancies

SIAM journal on discrete mathematics, 2020-01, Vol.34 (2), p.1148-1171

2020

Volltextzugriff (PDF)

Hybrid Noncoherent Network Coding

IEEE transactions on information theory, 2013-06, Vol.59 (6), p.317

2013

Volltextzugriff (PDF)

Hybrid Noncoherent Network Coding

IEEE transactions on information theory, 2013-06, Vol.59 (6), p.3317-3331

2013

Volltextzugriff (PDF)

Permutation (d,k) codes: efficient enumerative coding and phrase length distribution shaping

IEEE transactions on information theory, 2000-11, Vol.46 (7), p.2671-2675

2000

Volltextzugriff (PDF)

1 – 25 von 174

Menü

Weitere Dienste

Einstellungen

Subspace Pursuit for Compressive Sensing Signal Reconstruction

Error-Correction in Flash Memories via Codes in the Ulam Metric

Combinatorial constructions of low-density parity-check codes for iterative decoding

On the Hardness of Approximating Stopping and Trapping Sets

A Geometric Approach to Low-Rank Matrix Completion

Asymptotic Spectra of Trapping Sets in Regular and Irregular LDPC Code Ensembles

Sorting of Permutations by Cost-Constrained Transpositions

Weighted Superimposed Codes and Constrained Integer Compressed Sensing

Generalized low-density parity-check codes for optical communication systems

LDPC Codes Based on Latin Squares: Cycle Structure, Stopping Set, and Trapping Set Analysis

On unequal error protection LDPC codes based on plotkin-type constructions

Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes

Block-circulant low-density parity-check codes for optical communication systems

The Trapping Redundancy of Linear Block Codes

Semiquantitative Group Testing

Information Theoretical and Algorithmic Approaches to Quantized Compressive Sensing

On graphical representations of algebraic codes suitable for iterative decoding

Subspace Evolution and Transfer (SET) for Low-Rank Matrix Completion

Code Construction and Decoding Algorithms for Semi-Quantitative Group Testing With Nonuniform Thresholds

An Axiomatic Approach to Constructing Distances for Rank Comparison and Aggregation

Probabilistic Transforms for Combinatorial Urn Models

Set-Codes with Small Intersections and Small Discrepancies

Hybrid Noncoherent Network Coding

Hybrid Noncoherent Network Coding

Permutation (d,k) codes: efficient enumerative coding and phrase length distribution shaping

Suchergebnisse filtern