Abstract
A model in which a transmitter <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">T</tex> sends a message to a receiver <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">R</tex> via shared random-access memory is analyzed. In the model, the random-access memory consists of <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">L</tex> individually addressable cells, each of which may be set to a value from a finite alphabet. A message <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m</tex> is sent by writing values into some of the memory cells so that the memory state is consistent with some codeword for <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m</tex> . 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 transmitter <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">T</tex> may 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 transmitter <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">T</tex> . It is shown that the number of accesses by <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">T</tex> obeys a generalized Kraft inequality. Lower bounds are given for the worst case and average number of accesses.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
