• DocumentCode
    1435446
  • Title

    Class of linear binary codes

  • Author

    Hashim, A.A. ; Constantinides, A.G.

  • Author_Institution
    Imperial College of Science & Technology, Department of Electrical Engineering, London, UK
  • Volume
    121
  • Issue
    7
  • fYear
    1974
  • fDate
    7/1/1974 12:00:00 AM
  • Firstpage
    555
  • Lastpage
    558
  • Abstract
    A class of algebraic linear codes is introduced in which the parity-check matrix of the code is constructed by using a subset of the Abelian group of Walsh functions. These codes meet the Helgert and Stinaff upper bounds on minimum Hamming distance, and all the codes of this class are easily decodable by a one-step majority-logic algorithm.
  • Keywords
    codes; decoding; Abelian group; Helgert upper bounds; Stinaff upper bounds; Walsh functions; decoding; linear binary codes; minimum Hamming distance; parity check matrix;
  • fLanguage
    English
  • Journal_Title
    Electrical Engineers, Proceedings of the Institution of
  • Publisher
    iet
  • ISSN
    0020-3270
  • Type

    jour

  • DOI
    10.1049/piee.1974.0132
  • Filename
    5251975
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1435446