By Topic

An Efficient Algorithm for Searching Optimal Shortened Cyclic Single-Burst-Correcting 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
$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

4 Author(s)
Villalba, L.J.G. ; Dept. of Software Eng. & Artificial Intell. (DISIA), Univ. Complutense de Madrid (UCM), Madrid, Spain ; Cortez, J.R.F. ; Orozco, A.L.S. ; Blaum, M.

An efficient algorithm searching for the best (shortened) cyclic burst-correcting codes is presented. The efficiency of the algorithm stems from the fact that no repeated syndromes are computed. It is shown how to achieve this goal by using Gray codes.

Published in:

Communications Letters, IEEE  (Volume:16 ,  Issue: 1 )