Name
Abstract | ||
|---|---|---|
Insertion/Deletion codes for the Levenshtein distance are constructed by truncation of lattices for the L1 metric. These lattices are obtained from Construction A applied to binary codes and Z4-codes. Finally, Gilbert and Hamming type of bounds are derived. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/ISIT.2013.6620313 | ISIT |
Keywords | Field | DocType |
lattice,z4-codes,deletion channels,weight enumerator,hamming type,insertion channels,construction a,insertion/ deletion codes,lattice based codes,levenshtein distance,hamming codes,ν-series,binary codes,gilbert type,lee metric,lattices,vectors,measurement,zinc,encoding | Hamming code,Discrete mathematics,Combinatorics,Concatenated error correction code,Hamming(7,4),Block code,Expander code,Hamming distance,Reed–Muller code,Linear code,Mathematics | Conference |
ISSN | Citations | PageRank |
2157-8095 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lin Sok | 1 | 47 | 10.38 |
| Patrick Solé | 2 | 7 | 6.25 |
| Aslan Tchamkerten | 3 | 270 | 28.97 |