Deriving upper bounds on code size from existing bounds is a classical approach in coding theory, dating back to the seminal results of Elias, Bassalygo, and Levenshtein. We study a framework encompassing the Bassalygo--Elias and Levenshtein inequalities for binary and nonbinary (constant-weight) codes and provides cer...
A. Akhiiarov, Peter G. Boyvalenkov, D. Cherkashin et al.· 0 citations
This work generalizes three distance-based topological measures, namely closeness centrality, betweenness centrality and node eccentricity, using this new hypergraph distance, and shows that hypergraphs can be divided into three distinct classes, corresponding to the possible dominance of specific orders of interaction...
E. Vasil'yeva, L. Tupikina, D. Musatov et al.· Chaos, Solitons & Fracta...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.