IBM Journal of Research and Development
IBM Skip to main content
  Home     Products & services     Support & downloads     My account  

  Select a country  
Journals Home  
  Systems Journal  
Journal of Research
and Development
    Current Issue  
    Recent Issues  
    Papers in Progress  
    Recent publications  
    Author's Guide  
  Contact Us  
  Related links:  
     IBM Research  

IBM Journal of Research and Development  
Volume 27, Number 2, Page 94 (1983)
Constrained Channel Coding
  Full article: arrowPDF   arrowCopyright info


Arithmetic Codes for Constrained Channels

by G. N. N. Martin, G. G. Langdon,Jr., S. J. P. Todd
Arithmetic codes have been studied in the context of compression coding, i.e., transformations to code strings which take up less storage space or require less transmission time over a communications link. Another application of coding theory is that of noiseless channel coding, where constraints on strings in the channel symbol alphabet prevent an obvious mapping of data strings to channel strings. An interesting duality exists between compression coding and channel coding. The source alphabet and code alphabet of a compression system correspond, respectively, to the channel alphabet and data alphabet of a constrained channel system. The decodability criterion of compression codes corresponds to the representability criterion of constrained channel codes, the generalized Kraft Inequality has a dual inequality due to the senior author.
Related Subjects: Coding theory; Communications and communication networks