Cryptography and Coding
Henry J. Beker, F. C. Piper
Oxford University Press, USA, Aug 24, 1989 - Coding theory - 312 pages
This new title is based on papers presented at The Conference on Cryptography and Coding, the first such conference to bring together mathematicians working in both cryptography and coding theory. It is a "hands-on" volume that provides a state-of-the-art account of mathematical research in these closely inter-related areas, one that will enable readers to produce and store information efficiently, securely, and cost-effectively.
What people are saying - Write a review
We haven't found any reviews in the usual places.
The theory and generation of sets of uncorrelated
Information theory without the finiteness assumption
12 other sections not shown
Other editions - View all
ACF's applications authentication authorised bank binary bits block Boolean functions C0DES cascade channel cipher clock code words codetext column communication complementary sequences considered correlation corresponding coupler covert channel cross-correlation Cryptography cyclic cyclic codes detection digits electronic embedded array code encipherment encoded encryption equation erasures error control error pattern example finite frame frequency Gray codes Hadamard matrix Huffman code IEEE implementation information packets input integer INTR0DUCTI0N Kraft-McMillan equality Lemma length line coding linear m-sequence matrix Mealy machine method microcontroller modulo output participants password permutations plaintext plaintext symbols points PR sequences primitive polynomial product code quasi-ideal random received result row checks scheme shift register shift sequence signal signatories smart card sonar sequence Standard functions stream cipher subplane sync synchronisation technique Theorem throughput transaction transmission transmitted values vector zero zero-neighbours