Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). We apologize for the inconvenience.
By Topic

Maximum-distance linear codes (Corresp.)

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)

Described here is a linear code that has a maximum distance between codewords of k for a code of order 2^k . Since the minimum-maximum distance is k for a code of order 2^k , a class of minimum-maximum distance codes results. For an (n,k) linear code, k \leq n \leq k + k/2 for k even and k \leq n \leq k + (k - 1)/2 for k odd. Maximum-distance codes are found useful in encoding the states of sequential circuits.

Published in:

Information Theory, IEEE Transactions on  (Volume:17 ,  Issue: 5 )