Title :
Binary codes derived from the Hoffman-Singleton and Higman-Sims graphs
Author :
Tonchev, Vladimir D.
Author_Institution :
Dept. of Math. Sci., Michigan Technol. Univ., Houghton, MI, USA
fDate :
5/1/1997 12:00:00 AM
Abstract :
Some binary linear codes of length 50 and 100 are constructed using the adjacency matrices of the Hoffman-Singleton graph and the Higman-Sims graph, Some of the codes are optimal or nearly optimal for the given length and dimension. The dual codes admit majority logic decoding
Keywords :
decoding; dual codes; graph theory; linear codes; majority logic; matrix algebra; Higman-Sims graphs; Hoffman-Singleton graphs; adjacency matrices; binary linear codes; dual codes; majority logic decoding; nearly optimal codes; optimal linear codes; strongly regular graph; Algorithm design and analysis; Binary codes; Decoding; Error correction codes; Linear code; Logic; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
