By Topic

Class of Binary Systematic Codes Correcting Errors Occurring at Random and in 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

2 Author(s)

Presentation of results concerning the performance of a family of binary systematic codes of arbitrary size, correcting bursts of considerable length and/or random errors. The basic idea of these codes is due to C. Hobbs of the Air Force Cambridge Research Center. For the codes of two sub-families, practical decoding schemes are given. Also formulated are results concerning the use of these codes with erasure channels.

Published in:

Circuit Theory, IRE Transactions on  (Volume:6 ,  Issue: 5 )