Cart (Loading....) | Create Account
Close category search window
 

Two new binary codes obtained by shortening a generalized concatenated code

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

1 Author(s)
Tolhuizen, L.M.G.M. ; Philips Res. Lab., Eindhoven, Netherlands

The authors construct a [75,13,30] code and a [75,11,32] code. The minimum distances of these codes are one larger than the largest known (T. Verhoeff 1987) minimum distances of codes with the same length and dimension. As a [75,11,33] code does not exist, the [75,11,32] code is, in a sense, optimal. Both codes are obtained by judiciously shortening a [80,14,32] code that is obtained as a generalized concatenated code

Published in:

Information Theory, IEEE Transactions on  (Volume:37 ,  Issue: 6 )

Date of Publication:

Nov 1991

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.