• DocumentCode
    2208606
  • Title

    Self-orthogonal codes constructed from cyclic squares

  • Author

    Peng, Xiao-Hong ; Farrel, P.G.

  • Author_Institution
    Manchester Univ., UK
  • fYear
    1991
  • fDate
    2-6 Sep 1991
  • Firstpage
    244
  • Lastpage
    245
  • Abstract
    Self-orthogonal codes are a class of one-step majority logic decodable (MLD) codes; i.e. they have a very simple decoding algorithm and relatively low cost, although performance is below the theoretical limits of some codes with similar rate and minimum distances. The ideas of cyclic square and complete set of cyclic squares, and some operations on them, are introduced. From these one can easily construct a class of self-orthogonal codes. This kind of codes has the virtue of being adjustable in its error control capacities, and a strong potential to be employed in communication and information storage systems
  • Keywords
    error correction codes; matrix algebra; communication systems; cyclic squares; decoding algorithm; information storage systems; majority logic decodable codes; matrix algebra; self orthogonal codes;
  • fLanguage
    English
  • Publisher
    iet
  • Conference_Titel
    Digital Processing of Signals in Communications, 1991., Sixth International Conference on
  • Conference_Location
    Loughborough
  • Print_ISBN
    0-85296-522-2
  • Type

    conf

  • Filename
    151937