By Topic

Generating cyclically permutable codes (Corresp.)

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)

Large sets of cyclically permutable (or cyclically inequivalent) codewords can be created by interleaving the cyclic shifts of several shorter words and selecting a cyclically inequivalent subset from the resulting set, This correspondence presents an efficient algorithm for generating the cyclically inequivalent subset directly.

Published in:

IEEE Transactions on Information Theory  (Volume:20 ,  Issue: 4 )