DocumentCode
3507625
Title
Symbol-pair codes: Algebraic constructions and asymptotic bounds
Author
Cassuto, Yuval ; Litsyn, Simon
Author_Institution
ALGO Lab., EPFL, Lausanne, Switzerland
fYear
2011
fDate
July 31 2011-Aug. 5 2011
Firstpage
2348
Lastpage
2352
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.
Keywords
Hamming codes; algebraic codes; channel coding; cyclic codes; Hamming metric; algebraic cyclic code constructions; asymptotic lower bounds; pair-error coding theory; symbol-pair channels; Binary codes; Discrete Fourier transforms; Hamming distance; Measurement; Polynomials; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on
Conference_Location
St. Petersburg
ISSN
2157-8095
Print_ISBN
978-1-4577-0596-0
Electronic_ISBN
2157-8095
Type
conf
DOI
10.1109/ISIT.2011.6033982
Filename
6033982
Link To Document