Cart (Loading....) | Create Account
Close category search window
 

A simple general binary source code (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)

A source code for binary strings, admitting a simple and fast hardware implementation, is described. The code is an arithmetic code, and it is capable of encoding strings modeled by stationary or nonstationary sources alike without use of alphabet extension. In particular, in the case with a stationary independent information source, the code degenerates to a bitwise implementation of Golomb's run-length code.

Published in:

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

Date of Publication:

Sep 1982

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.