By Topic

A search procedure for finding optimum group codes for the binary symmetric channel

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

3 Author(s)

This paper presents a systematic procedure for finding optimum error-correcting group codes for the binary symmetric channel with m check digits and a minimum distance not less than do, where m and do are given integers. Some new schemes for reducing the computing time are used. The search procedure is readily programmable for computer execution and several programs were carried out on an IBM 7044. The newly found seven optimum triple-error-correcting group codes and six optimum double-error-correcting group codes including five quasi-perfect double-error-correcting codes are tabulated. Also, a list of optimum shortened cyclic codes found by a similar procedure is presented. The efficiency of the search procedure is demonstrated by the fact that the program yielded the new codes in a fairly short time.

Published in:

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