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

Communications via updates of shared memory (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

1 Author(s)

A model in which a transmitterTsends a message to a receiverRvia shared random-access memory is analyzed. In the model, the random-access memory consists ofLindividually addressable cells, each of which may be set to a value from a finite alphabet. A messagemis sent by writing values into some of the memory cells so that the memory state is consistent with some codeword form. The model differs from traditional source coding in several respects. The codeword may specify values for a noncontiguous subset of the memory cells and allow the remaining unspecified cells to be filled in by other users as they wish. Also, the transmitterTmay attempt to avoid writing a full codeword into memory by first reading some cells to determine the initial memory state partially. Thus, the cells accessed for transmission and the cells specified by a codeword may be distinct, unlike traditional noiseless source coding where the symbols sent and symbols received are identical. Here we analyze the operational characteristics of the transmitterT. It is shown that the number of accesses byTobeys a generalized Kraft inequality. Lower bounds are given for the worst case and average number of accesses.

Published in:

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

Date of Publication:

Jul 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.