𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for the computation of the minimum distance of LDPC codes

✍ Scribed by Daneshgaran, Fred ;Laddomada, Massimiliano ;Mondin, Marina

Publisher
John Wiley and Sons
Year
2006
Tongue
English
Weight
116 KB
Volume
17
Category
Article
ISSN
1124-318X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On computing the minimum distance of lin
On computing the minimum distance of linear codes
✍ Masami Mohri; Masakatu Morii πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 245 KB πŸ‘ 2 views

The weight distribution is an indispensable parameter in the performance evaluation of a code because of its importance in the analysis of the codes characteristics. Since the amount of computation needed to determine the overall weight distribution of a code usually depends on the number of data po

On computing the number of code words wi
On computing the number of code words with minimum weight for cyclic codes
✍ Masami Mohri; Masakatsu Morii πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 264 KB πŸ‘ 2 views

The weight distribution is an important parameter that determines the performance of a code. The minimum distance and the number of corresponding codes that can be derived from the weight distribution, greatly affect the performance of the code. The decoding error probability and other performance m

Estimating the minimum distance of large
Estimating the minimum distance of large-block turbo codes using iterative multiple-impulse methods
✍ Crozier, Stewart ;Guinand, Paul ;Hunt, Andrew πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 185 KB

## Abstract A difficult problem for turbo codes is the efficient and accurate determination of the distance spectrum, or even just the minimum distance, for specific interleavers. This is especially true for large blocks, with many thousands of data bits, if the distance is high. This paper compare

The optimality of Feng–Rao designed mini
The optimality of Feng–Rao designed minimum distance for Hermitian codes constructed by weight order based on pole order
✍ Daisuke Umehara; Shinji Miura; Tomohiko Uyematsu; Eiji Okamoto πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 313 KB πŸ‘ 2 views

The algebraic geometric code is known as a linear code that guarantees a relatively large minimum distance under the condition that the number of check symbols is kept constant, when the code length is long. Recently, Saints and Heegard presented a unified theory for decoding of the algebraic geomet