Über die implementierung redundanzfreier Codes zur datenverschlüsselung

H. Jürgensen; M. Kunze

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1986)

  • Volume: 20, Issue: 1, page 5-29
  • ISSN: 0988-3754

How to cite

top

Jürgensen, H., and Kunze, M.. "Über die implementierung redundanzfreier Codes zur datenverschlüsselung." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 20.1 (1986): 5-29. <http://eudml.org/doc/92247>.

@article{Jürgensen1986,
author = {Jürgensen, H., Kunze, M.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {redundancy free encodings; fast encodings; Markov source},
language = {ger},
number = {1},
pages = {5-29},
publisher = {EDP-Sciences},
title = {Über die implementierung redundanzfreier Codes zur datenverschlüsselung},
url = {http://eudml.org/doc/92247},
volume = {20},
year = {1986},
}

TY - JOUR
AU - Jürgensen, H.
AU - Kunze, M.
TI - Über die implementierung redundanzfreier Codes zur datenverschlüsselung
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1986
PB - EDP-Sciences
VL - 20
IS - 1
SP - 5
EP - 29
LA - ger
KW - redundancy free encodings; fast encodings; Markov source
UR - http://eudml.org/doc/92247
ER -

References

top
  1. 1. R. ASH, Information Theory, John Wiley und Sons, New York, 1965. Zbl0141.34904MR229475
  2. 2. K. L. CHUNG, Markov Chains with Stationary Transition Probabilities, Springer-Verlag, Berlin, 1967. Zbl0146.38401MR217872
  3. 3. F. C. FRICK und W. H. SUMBY, Control Tower Language, J. Acoust. Soc. Amer., Bd. 24, 1952, S. 595-596. 
  4. 4. F. JELINEK, Probabilistic Information Theory, McGraw-Hill Book Co., New York, 1968. Zbl0174.50702
  5. 5. F. JELINEK und K. S. SCHNEIDER, Variable-Length Encoding of Fixed-Rate Markov Sources for Fixed-Rate Channels, I.E.E.E. Trans. Information Theory, Bd. IT-20, 1974, S. 750-755. Zbl0301.94022MR459925
  6. 6. H. JÜRGENSEN und M. KUNZE, Charakterisierung redundanzfreier Codes zur Datenverschlüsselung, R.A.I.R.O., Informatique Théorique. Zbl0573.94003
  7. 7. T. C. PASCO, Source Coding Algorithms for Fast Data Compression, PhD Thesis, Stanford University, CA, 1976. 
  8. 8. F. RUBIN, Cryptographic Aspects of Data Compression Codes, Cryptologia, Bd. 3, 1979, S. 202-205. Zbl0416.94014
  9. 9. F. RUBIN, Arithmetic Stream Coding Using Fixed Precision Registers, I.E.E.E. Trans. Information Theory, Bd. IT-25, 1979, S. 672-675. Zbl0422.94029MR551265
  10. Zusatz während der Korrektur : Das Dekodierungsproblem wurde von uns mittlerweile in der Arbeit « Complexity of Redundance-Free Codes », Report 142, Dep. Comp. Sci., Univ. Western Ont., 1985, gelöst. 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.