By Topic

Efficient Shortened Cyclic Codes Correcting Either Random Errors or Bursts

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.

Efficient cyclic or shortened cyclic codes that can correct either up to t errors or a single burst of length up to b, where t <; b, are presented, as well as a search algorithm based on syndrome computation for each possible generator polynomial. Previously known results are improved by the new codes.

Published in:

Communications Letters, IEEE  (Volume:15 ,  Issue: 7 )