TY - GEN
T1 - A note on non-binary multiple insertion/deletion correcting codes
AU - Palunčić, Filip
AU - Swart, Theo G.
AU - Weber, Jos H.
AU - Ferreira, Hendrik C.
AU - Clarke, Willem A.
PY - 2011
Y1 - 2011
N2 - We propose the construction of a non-binary multiple insertion/deletion correcting code based on a binary multiple insertion/deletion correcting code. In essence, it is a generalisation of Tenengol'ts' non-binary single insertion/deletion correcting code. We evaluate the cardinality of the proposed construction based on the asymptotic upper bound on the cardinality of a maximal binary multiple insertion/deletion correcting code derived by Levenshtein.
AB - We propose the construction of a non-binary multiple insertion/deletion correcting code based on a binary multiple insertion/deletion correcting code. In essence, it is a generalisation of Tenengol'ts' non-binary single insertion/deletion correcting code. We evaluate the cardinality of the proposed construction based on the asymptotic upper bound on the cardinality of a maximal binary multiple insertion/deletion correcting code derived by Levenshtein.
UR - http://www.scopus.com/inward/record.url?scp=83655192990&partnerID=8YFLogxK
U2 - 10.1109/ITW.2011.6089584
DO - 10.1109/ITW.2011.6089584
M3 - Conference contribution
AN - SCOPUS:83655192990
SN - 9781457704376
T3 - 2011 IEEE Information Theory Workshop, ITW 2011
SP - 683
EP - 687
BT - 2011 IEEE Information Theory Workshop, ITW 2011
T2 - 2011 IEEE Information Theory Workshop, ITW 2011
Y2 - 16 October 2011 through 20 October 2011
ER -