๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On Tanner Codes: Minimum Distance and Decoding

โœ Scribed by H. Janwa; A. K. Lal

Publisher
Springer
Year
2003
Tongue
English
Weight
111 KB
Volume
13
Category
Article
ISSN
0938-1279

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On Multisequence Shift Register Synthesi
On Multisequence Shift Register Synthesis and Generalized-Minimum-Distance Decoding of Reed-Solomon Codes
โœ N. Kamiya ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 618 KB

In this paper. it is shown that the problem of generalized-minimum-distance (GMD) decoding of Reed-Solomon (RS) codes can be reduced to the problem of multisequence shift register synthesis, and a simple algorithm is presented that yields a solution for this problem by finding, for \(k=1,2, \ldots\)

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