By Topic

Some new efficient second-order spectral- codes with small lookup tables

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
$31 $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)
Ching-Nung Yang ; Dept. of Comput. Sci. & Inf. Eng., Nat. Dong Hwa Univ., Hualien, Taiwan ; Dong-Jing Lee

Tallini and Bose introduced a recursive method to construct second-order spectral- codes which result in short (information length 16) base optimal second-order spectral- codes that can be easily implemented either with table lookup or enumerative coding. In this paper, the extended base suboptimal second-order spectral- codes (17 information length 32) obtained from two short base codes by lookup table are used to reduce the overall code length.

Published in:

Computers, IEEE Transactions on  (Volume:55 ,  Issue: 7 )