By Topic

A tree construction method of nested cyclic codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Felipe Cinelli Barbosa ; School of Electrical and Computer Engineering, University of Campinas - Unicamp, Campinas, SP - Brazil ; Max H. M. Costa

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.

Published in:

Information Theory Workshop (ITW), 2011 IEEE

Date of Conference:

16-20 Oct. 2011