ProceedingsIEEE, 1994 - Information theory |
Contents
The Shannon Lecture | 1 |
On The OPTA Function For Lossless Compression Of Individual Sequences Via Recursive Sequential Codes | 7 |
Adaptive Update Algorithms for Fixed Dictionary Lossless Data CompressorsShamoon T and Heegard C | 14 |
Copyright | |
87 other sections not shown
Common terms and phrases
Abstract achievable applications asymptotic BCH codes binary bit error block codes C₁ capacity CDMA code of length codebook codeword communication complexity compression Computer consider constraint construction convolutional codes correlation coset cyclic codes data compression defined denote density detection detector distribution encoder entropy error probability estimation fading channel filter finite function Gaussian given Hamming Hamming distance Hamming weight IEEE IEEE Trans Information Theory input integer linear codes lower bound Markov matrix maximum memoryless method metric minimal minimum distance modulation multiple access node noise obtained optimal optimum output packet parameters performance permutation polynomial problem Proc properties Rayleigh fading receiver redundancy REFERENCES samples scheme sequence shown signal simulation spectral symbol synchronization technique Theorem tion transmission transmitted trellis codes University upper bound users values vector quantizer Viterbi Viterbi algorithm Viterbi decoder weight