Lecture Notes in Computer Science

Constructive problems for irreducible polynomials over finite fields.- Singular algebraic curves over finite fields.- A divisionless form of the Schur Berlekamp-Massey algorithm.- Error-control coding, modulation and equalization for all-digital advanced television: State of the art and future possibilities.- A finite field arithmetic unit VLSI chip.- A successful attack against the DES.- Low-complexity and high-performance multilevel coded modulation for the AWGN and Rayleigh fading channels.- Channel coding for a frequency-hopped wireless transceiver.- A unified view of noncoherent detection and differential detection of phase modulated signals.- Error reduction of coded DPSK over a fading channel.- Performance of BCH codes with DES encryption in a digital mobile channel.- Reduced-complexity channel estimation and equalization for TDMA mobile radio systems.- Probability of packet success for asynchronous DS/CDMA with block and convolutional codes.- Sequential decoding on intersymbol interference channels under the Pe-criterion.- Separable concatenated codes with iterative map filtering.- Adapting the strongly-connected trellis concept for use with trellis-coded modulation.- Variable-rate punctured Trellis-Coded Modulation and applications.- Trellis-based decoding of binary linear block codes.- Permutation decoding using primitive elements as multipliers.- Overflow constraint in hybrid nodes with movable boundary scheme.- Statistical analysis of wavelet transform coded multi-channel signals for transmission over ATM packet networks.- Statistical analysis of the traffic generated by the superposition of N independent interrupted poisson processes.- Throughput increase of ALOHA-based systems with multiuser sequence detection.- Auto-regressive transfer function identification using chaos.- A new algorithm for signal classification using phase information.- Efficient algorithms for fixed-rate entropy-coded vector quantization.