A course in error-correcting codes. (Q1422079)

From MaRDI portal
Revision as of 04:17, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A course in error-correcting codes.
scientific article

    Statements

    A course in error-correcting codes. (English)
    0 references
    0 references
    0 references
    18 February 2004
    0 references
    The book covers most of the basic problems related to codes for error-correction. The authors give an introduction to linear codes, vector spaces, finite fields, channel models and channel capacity. Based on such fundamental knowledge the authors present principles of Reed-Solomon codes and their decoding algorithms -- attaching also definitions and theorems on properties of specific Reed-Solomon codes. The authors investigate cyclic codes, which are still important. Also in this chapter BCH and Reed-Solomon codes are considered. In the following chapters convolutional codes with their properties and decoding schemes are presented. The next chapters cover the performance and properties of concatenated codes. The authors also present, in more detail, selected decoding problems, including the Euclidean and list decoding algorithms for Reed-Solomon codes, factorization problems, iterative decoding for low density codes, and algebraic geometry codes. The book material is illustrated with a set of example problems and their solutions. All of this makes the book a useful compendium of fundamentals on error-correcting codes.
    0 references
    error-correcting codes
    0 references
    linear codes
    0 references
    convolutional codes
    0 references
    decoding algorithms
    0 references
    Reed-Solomon codes
    0 references
    concatenated codes
    0 references
    channel models
    0 references
    cyclic codes
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references