Name
Abstract | ||
|---|---|---|
We consider two metrics decoding equivalent if they impose the same minimum distance decoding for every code. It is known that, up to this equivalence, every metric is isometrically embeddable into the Hamming cube. We present an algorithm which for any translation invariant metric gives an upper bound on the minimum dimension of such an embedding. We also give lower and upper bounds for this embedding dimension over the set of all such metrics. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.3934/amc.2017029 | ADVANCES IN MATHEMATICS OF COMMUNICATIONS |
Keywords | Field | DocType |
Coding theory,hypercube embeddings,maximum-likelihood decoding,minimum distance decoding | Discrete mathematics,Hamming code,Combinatorics,Embedding,Upper and lower bounds,Equivalence (measure theory),Coding theory,Hamming distance,Invariant (mathematics),Decoding methods,Mathematics | Journal |
Volume | Issue | ISSN |
11 | SP2 | 1930-5346 |
Citations | PageRank | References |
1 | 0.37 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rafael Gregorio Lucas D'Oliveira | 1 | 18 | 3.43 |
| Marcelo Firer | 2 | 85 | 18.24 |