By Topic

Systematic encoding of the Varshamov-Tenengol'ts codes and the Constantin-Rao codes

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)
Abdel-Ghaffar, K.A.S. ; Dept. of Electr. & Comput. Eng., California Univ., Davis, CA, USA ; Ferreira, H.C.

The maximum number of information bits that can be encoded systematically by the number-theoretic codes of Varshamov and Tenengol'ts (1965) is determined. This number is also studied for the more general class of the group-theoretic Constantin-Rao (1979) codes. Although these codes are at least as large as the Varshamov-Tenengol'ts codes, it is shown that the number of bits that can be systematically encoded using a Constantin-Rao code does not exceed the number of bits that can be systematically encoded using a Varshamov-Tenengol'ts code. In fact, in many cases, the largest Constantin-Rao code has the least number of bits that can be systematically encoded

Published in:

Information Theory, IEEE Transactions on  (Volume:44 ,  Issue: 1 )