By Topic

Minimal distance lexicographic codes over an infinite alphabet

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)
Herscovici, D.S. ; Dept. of Math., MIT, Cambridge, MA, USA

The author investigates the properties of minimal distance lexicographic codes, or lexicode, over the ordered infinite alphabet N={0,1,2…}. The author presents a method for computing the basis of such a code. It is shown that any lexicographic code S with minimal distance d has a unique basis where each basis vector is a one followed by a string of zeros, followed by d-1 nonzero digits aij. Furthermore, the matrix A=(aij) has no singular minors over the nim-field. The dual code when S has finite length is also computed. The author develops a systematic approach to determine which words belong to these lexicodes

Published in:

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