Iterative probabilistic decoding and parity checks with memory

Electronics Letters

Volumn 35, Issue 20, 1999, Pages 1721-1723

  Golic J Dj ^a  

^a UNIVERSITY OF BELGRADE   (Serbia)

Author keywords

[No Author keywords available]

Indexed keywords

BIT ERROR RATE; CRYPTOGRAPHY; DECODING; LINEAR EQUATIONS; POLYNOMIALS; RANDOM PROCESSES; RECURSIVE FUNCTIONS; SHIFT REGISTERS;

ITERATIVE PROBABILISTIC DECODING ALGORITHMS; LINEAR FEEDBACK SHIFT REGISTER; PARITY CHECKS WITH MEMORY;

ALGORITHMS;

EID: 0033193646     PISSN: 00135194     EISSN: None     Source Type: Journal    
DOI: 10.1049/el:19991146     Document Type: Article

References (5)

1. BAHL, L.R., COCKE, J., JELINEK, F., and RAVIV, J.: 'Optimal decoding of linear codes for minimising symbol error rate', IEEE Trans., 1974, IT-20, pp. 284-287
2. GOLIĆ, J.DJ.: 'Computation of low-weight parity check polynomials', Electron. Lett., 1998, 32, (21), pp. 1981-1982
3. JOHANSSON, T., and JONNSON, F.: 'Improved fast correlation attacks on stream ciphers via convolutional codes'. Advances in Cryptology - EUROCRYPT '99, 1999, Vol. 1592, pp. 347-362 (Lecture Notes in Computer Science)
4. MEIER, W., and STAFFELBACH, O.: 'Fast correlation attacks on certain stream ciphers', J. Cryptol., 1989, 1, (3), pp. 159-176
5. MIHALJEVIĆ, M.J., and GOLIĆ, J.DJ: 'Convergence of a Bayesian iterative error-correction procedure on a noisy shift register sequence'. Advances in Cryptology - EUROCRYPT '92, 1999, Vol. 658, pp. 124-137 (Lecture Notes in Computer Science)