Symbol-pair codes: Algebraic constructions and asymptotic bounds

Yuval Cassuto, Simon Litsyn

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publication2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Pages2348-2352
Number of pages5
DOIs
StatePublished - 2011
Event2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011 - St. Petersburg, Russian Federation
Duration: 31 Jul 20115 Aug 2011

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8104

Conference

Conference2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Country/TerritoryRussian Federation
CitySt. Petersburg
Period31/07/115/08/11

Fingerprint

Dive into the research topics of 'Symbol-pair codes: Algebraic constructions and asymptotic bounds'. Together they form a unique fingerprint.

Cite this