DocumentCode :
2452989
Title :
A tree construction method of nested cyclic codes
Author :
Barbosa, Felipe Cinelli ; Costa, Max H M
Author_Institution :
Sch. of Electr. & Comput. Eng., Univ. of Campinas - Unicamp, Campinas, Brazil
fYear :
2011
fDate :
16-20 Oct. 2011
Firstpage :
302
Lastpage :
305
Abstract :
This paper presents a tree-based algebraic construction of nested cyclic codes through a tree construction method. These codes can be used to encode different data packets, producing codewords that are added for transmission. Both encoding and decoding are performed by polynomial operations with no need of side information, so the proposed scheme may be useful in applications that require low computational complexity. In cases where the number of information sources is large, it is convenient to design the system in a systematic manner. Hence, the tree construction method may contribute to simplify the code design.
Keywords :
computational complexity; cyclic codes; decoding; trees (mathematics); computational complexity; decoding; encoding; nested cyclic codes; polynomial operations; tree-based algebraic construction; Decoding; Encoding; Error correction; Error correction codes; Generators; Polynomials; Receivers; Nested cyclic codes; linear block codes; partitioned cyclic codes;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory Workshop (ITW), 2011 IEEE
Conference_Location :
Paraty
Print_ISBN :
978-1-4577-0438-3
Type :
conf
DOI :
10.1109/ITW.2011.6089441
Filename :
6089441
Link To Document :
بازگشت