By Topic

Maximal Group Codes with Specified Minimum Distance

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 $33
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

1 Author(s)
A. M. Patel ; IBM Systems Development Division Laboratory, Poughkeepsie, New York, 12602 USA

All n-digit maximal block codes with a specified minimum distance d such that 2d ≥ n can be constructed from the Hadamard matrices. These codes meet the Plotkin bound. In this paper we construct all maximal group codes in the region 2d ≥ n, where d is a specified minimum distance and n is the number of digits per code word. Unlike the case of block codes, the Plotkin upper limit, in general, fails to determine the number of code words B(n, d) in a maximal group code in the region 2d ≥ n. We show that the value of B(n, d) largely depends on the binary structure of the number d. An algorithm is developed that determines B(n, d), the maximum number of code words for given d and n ≤ 2d. The maximal code is, then, given by its modular representation, explicitly in terms of certain binary coefficients and constants related to n and d. As a side result, we obtain a new upper bound on the number of code words in the region 2d < n which is, in general, stronger than Plotkin's extended bound.

Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.  

Published in:

IBM Journal of Research and Development  (Volume:14 ,  Issue: 4 )