conference paper
Symbol-Pair Codes: Algebraic Constructions and Asymptotic Bounds
Cassuto, Yuval
•
Litsyn, Simon
2011
2011 Ieee International Symposium On Information Theory Proceedings (Isit)
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.
Type
conference paper
Web of Science ID
WOS:000297465102126
Author(s)
Cassuto, Yuval
Litsyn, Simon
Date Issued
2011
Published in
2011 Ieee International Symposium On Information Theory Proceedings (Isit)
ISBN of the book
978-1-4577-0595-3
Start page
2348
End page
2352
Subjects
Editorial or Peer reviewed
NON-REVIEWED
Written at
EPFL
EPFL units
| Event name | Event place | Event date |
St Petersburg, RUSSIA | Jul 31-Aug 05, 2011 | |
Available on Infoscience
June 25, 2012
Use this identifier to reference this record