New Results On The Pseudoredundancy

Zihui Liu
2019
Article

The concepts of pseudocodeword and pseudoweight play a fundamental role in the finite-length analysis of LDPC codes. The pseudoredundancy of a binary linear code is defined as the minimum number of rows in a parity-check matrix such that the corresponding minimum pseudoweight equals its minimum Hamming distance. By using the value assignment of Chen and Klove we present new results on the pseudocode-word redundancy of binary linear codes. In particular, we give several upper bounds on the pseudoredundancies of certain codes with repeated and added coordinates and of certain shortened subcodes. We also investigate several kinds of k-dimensional binary codes and compute their exact pseudocodeword redundancy.

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Concepts associés

Chargement

Publications associées

Chargement

Zihui Liu
2019
Article

Résumé

Official source

https://infoscience.epfl.ch/record/267040?ln=fr

À propos de ce résultat

Concepts associés (6)

Concepts associés

Chargement

Publications associées (1)

Publications associées

Chargement

Code (information)

vignette|redresse|Code morse international. En sciences et techniques, notamment en informatique et en théorie de l'information, un code est une règle de transcription qui, à tout symbole d'un jeu de

Code linéaire

En mathématiques, plus précisément en théorie des codes, un code linéaire est un code correcteur ayant une certaine propriété de linéarité. Plus précisément, un tel code est structuré comme un sous-e

Codes de parité à faible densité

Dans la théorie de l'information, un contrôle de parité de faible densité LDPC est un code linéaire correcteur d'erreur, permettant la transmission d'information sur un canal de transmission bruité.

Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels

Seyed Hamed Hassani, Shrinivas Kudekar, Yury Polyanskiy, Rüdiger Urbanke

Consider a binary linear code of length N, minimum distance d(min), transmission over the binary erasure channel with parameter 0 < epsilon < 1 or the binary symmetric channel with parameter 0 < epsilon < 1/2, and block-MAP decoding. It was shown by Tillich and Zemor that in this case the error probability of the block-MAP decoder transitions "quickly" from delta to 1-delta for any delta > 0 if the minimum distance is large. In particular the width of the transition is of order O(1/root d(min)). We strengthen this result by showing that under suitable conditions on the weight distribution of the code, the transition width can be as small as Theta(1/N1/2-kappa), for any kappa > 0, even if the minimum distance of the code is not linear. This condition applies e.g., to Reed-Mueller codes. Since Theta(1/N-1/2) is the smallest transition possible for any code, we speak of "almost" optimal scaling. We emphasize that the width of the transition says nothing about the location of the transition. Therefore this result has no bearing on whether a code is capacity-achieving or not. As a second contribution, we present a new estimate on the derivative of the EXIT function, the proof of which is based on the Blowing-Up Lemma.

IEEE2018

Chargement