Charakterisierung redundanzfreier codes zur datenverschlüsselung

H. Jürgensen; M. Kunze

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

  • Volume: 18, Issue: 2, page 131-146
  • ISSN: 0988-3754

How to cite

top

Jürgensen, H., and Kunze, M.. "Charakterisierung redundanzfreier codes zur datenverschlüsselung." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 18.2 (1984): 131-146. <http://eudml.org/doc/92202>.

@article{Jürgensen1984,
author = {Jürgensen, H., Kunze, M.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {discrete information source; data protection; redundancy-free code; arithmetic mapping; cryptography; crypto-code},
language = {ger},
number = {2},
pages = {131-146},
publisher = {EDP-Sciences},
title = {Charakterisierung redundanzfreier codes zur datenverschlüsselung},
url = {http://eudml.org/doc/92202},
volume = {18},
year = {1984},
}

TY - JOUR
AU - Jürgensen, H.
AU - Kunze, M.
TI - Charakterisierung redundanzfreier codes zur datenverschlüsselung
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1984
PB - EDP-Sciences
VL - 18
IS - 2
SP - 131
EP - 146
LA - ger
KW - discrete information source; data protection; redundancy-free code; arithmetic mapping; cryptography; crypto-code
UR - http://eudml.org/doc/92202
ER -

References

top
  1. 1. P. ANDELMAN, und J. REEDS, On the Cryptanalysis of Rotor Machines and Substitution-Permutation Networks, I.E.E.E. Trans. Information Theory IT-28, 1982, p. 578-584. Zbl0484.94026
  2. 2. R. ASH, Information Theory, John Wiley & Sons, New York, 1965. Zbl0141.34904MR229475
  3. 3. J. DUSKE und H. JÜRGENSEN, Codierungstheorie, Bi-Wissenschaftsverlag, Mannheim, 1977. Zbl0403.94011MR529774
  4. 4. P. ELIAS, (Unveröffentlicht, vgl. [6]). 
  5. 5. S. GUIASU, Information Theory with Applications, McGraw-Hül Book Co., New York, 1977. Zbl0379.94027MR504352
  6. 6. F. JELINEK, Probabilistic Information Theory, McGraw-Hill Book Co., New York, 1968. Zbl0174.50702
  7. 7. F. JELINEK und G. LONGO, Algorithms for Source Coding ; in : G. LONGO (Hrsg.), Coding and Complexity, C.I.S.M. Courses and Lectures 216, Springer-Verlag, Wien, New York, 1975, p. 293-330. Zbl0357.94021
  8. 8. H. JÜRGENSEN und M. KUNZE, Über die Implementierung redundanzfreier Codes zur Datenverschlüsselung, Erscheint in R.A.I.R.O. Zbl0608.94010
  9. 9. H. JÜRGENSEN und D. MATTHEWS, The Information Theoretic Analysis of Cryptosystems, Erscheint im Tagungsband von Crypto '83, Santa Barbara, 1983. 
  10. 10. R. C. PASCO, Source Coding Algorithms for Fast Data Compression, Ph. D. Thesis, Stanford University, CA, 1976. 
  11. 11. F. RUBIN, Cryptographic Aspects of Data Compression Codes, Cryptologia 3, 1979, p. 202-205. Zbl0416.94014
  12. 12. F. RUBIN, Arithmetic Stream Coding Using Fixed Precision Registers, I.E.E.E. Trans. Information Theory IT-25, 1979, p. 672-675. Zbl0422.94029MR551265
  13. 13. N. RYSKA und S. HERDA, Kryptographische Verfahren in der Datenverarbeitung, Informatik Fachbereichte 24, Springer-Verlag, Berlin, Heidelberg, New York, 1980. Zbl0426.68107
  14. 14. C. E. SHANNON, Communication Theory of Secrecy Systems, Bell Syst. Techn. J. 28, 1949, p. 656-715. Zbl1200.94005MR32133

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.