Name
Abstract | ||
|---|---|---|
The construction of deletion codes for the Levenshtein metric is reduced to the construction of codes over the integers for the Manhattan metric by run length coding. The latter codes are constructed by expurgation of translates of lattices. These lattices, in turn, are obtained from Construction~A applied to binary codes and $\Z_4-$codes. A lower bound on the size of our codes for the Manhattan distance are obtained through generalized theta series of the corresponding lattices. |
Year | Venue | Field |
|---|---|---|
2014 | CoRR | Discrete mathematics,Combinatorics,Concatenated error correction code,Upper and lower bounds,Binary code,Block code,Euclidean distance,Expander code,Deletion channel,Linear code,Mathematics |
DocType | Volume | Citations |
Journal | abs/1406.1055 | 0 |
PageRank | References | Authors |
0.34 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lin Sok | 1 | 47 | 10.38 |
| Patrick Solé | 2 | 7 | 6.25 |
| Aslan Tchamkerten | 3 | 270 | 28.97 |