| Autor: |
Boyvalenkov, P., Delchev, K., Zinoviev, V. A., Zinoviev, D. V. |
| Předmět: |
|
| Zdroj: |
Problems of Information Transmission; Oct2022, Vol. 58 Issue 4, p352-371, 20p |
| Abstrakt: |
We enumerate all -ary additive (in particular, linear) block codes of length and cardinality with exactly two distances: and . For arbitrary codes of length with distances and , we obtain upper bounds on the cardinality via linear programming and using relationships to 2-distance sets on a Euclidean sphere. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
Full text from SpringerLink