On metric properties of maps between Hamming spaces and related graph homomorphisms
A mapping of k-bit strings into n-bit strings is called an (α,β)-map if k-bit strings which are more than αk apart are mapped to n-bit strings that are more than βn apart in Hamming distance. This is a relaxation of the classical problem of constructing error-correcting codes, which corresponds to α...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Elsevier BV,
2019-08-07T12:00:16Z.
|
| Subjects: | |
| Online Access: | Get fulltext |