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
fDate :
7/1/1974 12:00:00 AM
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;
Journal_Title :
Electrical Engineers, Proceedings of the Institution of
DOI :
10.1049/piee.1974.0132
