Symbol-Pair Codes: Algebraic Constructions and Asymptotic Bounds
Cassuto, Yuval; Litsyn, Simon
2011

Abstract

For the recently proposed model of symbol-pair channels, we advance the pair-error coding theory with algebraic cyclic-code constructions and asymptotic bounds on code rates. Cyclic codes for pair-errors are constructed by a careful use of duals of known tools from cyclic-code theory. Asymptotic lower bounds on code rates show that codes for pair-errors provably exist for rates strictly higher than codes for the Hamming metric.

Details

Title Symbol-Pair Codes: Algebraic Constructions and Asymptotic Bounds
Author(s) Cassuto, Yuval ; Litsyn, Simon
Published in 2011 Ieee International Symposium On Information Theory Proceedings (Isit)
Pages 2348-2352
Conference IEEE International Symposium on Information Theory (ISIT), St Petersburg, RUSSIA, Jul 31-Aug 05, 2011
Date 2011
Publisher Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa
ISBN 978-1-4577-0595-3
Keywords
DOI https://doi.org/10.1109/ISIT.2011.6033982
Other identifier(s) View record in Web of Science
Laboratories ALGO
Record Appears in Scientific production and competences > I&C - School of Computer and Communication Sciences > IINFCOM > ALGO - Algorithmics Laboratory
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Conference Papers
Work produced at EPFL
Published
Record creation date 2012-06-25

Actions