Binary codes derived from the Hoffman-Singleton and Higman-Sims graphs

Authors

Vladimir Tonchev, Michigan Technological UniversityFollow

Document Type

Article

Publication Date

5-1997

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.

Publisher's Statement

Copyright 1997 IEEE. Publisher’s version of record: https://dx.doi.org/10.1109/18.568714

Publication Title

IEEE Transactions on Information Theory

Recommended Citation

Tonchev, V. (1997). Binary codes derived from the Hoffman-Singleton and Higman-Sims graphs. IEEE Transactions on Information Theory, 43(3), 1021-1025. http://doi.org/10.1109/18.568714
Retrieved from: https://digitalcommons.mtu.edu/math-fp/149