DocumentCode :
3505695
Title :
High rate fibonacci polynomial codes
Author :
Esmaeili, Mostafa ; Esmaeili, Morteza ; Gulliver, T. Aaron
Author_Institution :
Dept. of ECE, Isfahan Univ. of Technol., Isfahan, Iran
fYear :
2011
fDate :
July 31 2011-Aug. 5 2011
Firstpage :
1921
Lastpage :
1924
Abstract :
A new class of high rate Fibonacci polynomial based error-correcting codes is introduced. For integers m; n; x ≥ 1, a square encoding matrix Q2mn(x) of order 2m and the corresponding decoding matrix Q2m-n(x) are provided. It is shown that a higher code rate is obtained than with the original Fibonacci polynomial based codes.
Keywords :
error correction codes; polynomial matrices; Fibonacci polynomial codes; decoding matrix; error correcting codes; square encoding matrix; Chaos; Decoding; Encoding; Fractals; Polynomials; Solitons;
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.6033886
Filename :
6033886
Link To Document :
بازگشت