By Topic

Notes on the penny-weighing problem, lossless symbol coding with nonprimes, etc.

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

1 Author(s)

The method of construction of lossless symbol coding matrices for one-error correction is illustrated for the case when the prime symbol order is three, and the application of this matrix to the penny-weighing problem is described. This method is then extended to those cases in which the symbol order is 2^2, 2^3, 2^4, 2^6, 3^2, 3^3, 3^4, 3^5, 5^2, 5^3, 5^4, 7^2, 7^3 , and p^2 , where p is any higher prime. This extension is based on the concept of the master iterating matrix. These matrices are given for the first thirteen cases cited, and their existence is demonstrated for p^2 . This paper concludes with a short description of Zaremba's condition, and its application to various problems, and more particularly to the hypothetical one-error correcting close-packed code with the symbol order 6.

Published in:

IRE Transactions on Information Theory  (Volume:4 ,  Issue: 3 )