By Topic

Variable-length integer codes based on the Goldbach conjecture, and other additive 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

1 Author(s)
Fenwick, P. ; Dept. of Comput. Sci., Auckland Univ., New Zealand

This article introduces a new family of variable-length codes for the integers, initially based on the Goldbach conjecture that every even integer is the sum of two primes. For an even integer we decompose the value into its two constituent primes and encode the ordinal numbers of those primes with an Elias (1975) γ code. The method is then elaborated to handle odd integers. The article then develops a more general method of encoding any integer as the sum of two integers and developing suitable basis sets of integers. Although the codes which are generated by these methods are characterized by widely varying and unpredictable lengths, they are over some ranges shorter than most other variable-length codes.

Published in:

Information Theory, IEEE Transactions on  (Volume:48 ,  Issue: 8 )