
doi: 10.1109/18.568714
The author gives some binary linear codes of length 50 and 100 using the adjacency matrices of the Hoffman-Singleton graph and the Higman-Sims graph. Some of these codes are optimal or nearly optimal for the given length and dimension. The author also gives the weight distribution of the codes and observes that the dual codes admit majority logic decoding.
majority decoding, optimal linear code, Graphs and linear algebra (matrices, eigenvalues, etc.), automorphism group of a graph, strongly regular graph, weight distribution, Linear codes (general theory)
majority decoding, optimal linear code, Graphs and linear algebra (matrices, eigenvalues, etc.), automorphism group of a graph, strongly regular graph, weight distribution, Linear codes (general theory)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 12 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
