• DocumentCode
    1559143
  • Title

    Composition of Reed-Solomon codes and geometric designs

  • Author

    Roth, Ron M. ; Lempel, Abraham

  • Author_Institution
    Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
  • Volume
    34
  • Issue
    4
  • fYear
    1988
  • fDate
    7/1/1988 12:00:00 AM
  • Firstpage
    810
  • Lastpage
    816
  • Abstract
    It is shown that good linear (n,k,d) codes over a finite field GF(q) can be constructed by concatenating the generator matrices of Reed-Solomon codes. For the case of k=3, it is shown that many of the codes obtained using projective-geometry techniques can readily be obtained by the proposed algebraic approach
  • Keywords
    error correction codes; Reed-Solomon codes; algebraic approach; finite field GF(q); generator matrices; geometric designs; linear (n,k,d) codes; projective-geometry techniques; Computer science; Galois fields; Geometry; Polynomials; Reed-Solomon codes;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.9778
  • Filename
    9778
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1559143