A BEAST for prowling in trees

IEEE Transactions on Information Theory

Volumn 50, Issue 6, 2004, Pages 1295-1302

  Bocharova, Irina E ^a   Handlery, Marc ^b,c   Johannesson, Rolf ^b   Kudryashov, Boris D ^a  

^a SAINT PETERSBURG STATE UNIVERSITY OF AEROSPACE INSTRUMENTATION   (Russian Federation)

^b LUND UNIVERSITY   (Sweden)

^c Union Bank of Switzerland   (Switzerland)

Author keywords

Bidirectional search; Convolutional codes; Distance spectrum; Free distance; Tailbiting codes

Indexed keywords

ALGORITHMS; CONVOLUTIONAL CODES; ENCODING (SYMBOLS); TRELLIS CODES;

BIDIRECTIONAL EFFICIENT ALGORITHMS FOR SEARCHING TREES; DISTANCE SPECTRUM; TAILBITING CODES;

TREES (MATHEMATICS);

EID: 2942668327     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2004.828093     Document Type: Letter

References (15)

1. L. R. Bahl, C. D. Cullum, W. D. Frazer, and F. Jelinek, "An efficient algorithm for computing free distance," IEEE Trans. Inform. Theory, vol. IT-18, pp. 437-439, May 1972.
2. K. J. Larsen, "An efficient algorithm for computing free distance," IEEE Trans. Inform. Theory, vol. IT-19, pp. 577-579, July 1973.
3. M. Rouanne and D. J. Costello, Jr, "An algorithm for computing the distance spectrum of trellis codes," IEEE J. Select. Areas Commun., vol. 7, pp. 929-940, Aug. 1989.
4. M. Cedervall and R. Johannesson, "A fast algorithm for computing distance spectrum of convolutional codes," IEEE Trans. Inform. Theory, vol. 35, pp. 1146-1159, Nov. 1989.
5. G. Solomon and H. C. A. van Tilborg, "A connection between block and convolutional codes," SIAM J. Appl. Math., vol. 37, pp. 358-369, 1979.
6. J. H. Ma and J. K. Wolf, "On tail-biting convolutional codes," IEEE Trans. Commun., vol. COM-34, pp. 104-111, Feb. 1986.
7. I. Bocharova, R. Johanneson, M. Lončar, and B. Kudryashov, "BEAST decoding for block codes," in Proc. 5th Int. ITG Conf. Source and Channel Coding, Erlangen, Germany, Jan. 2004, pp. 173-178.
8. R. Johanneson and K. S. Zigangirov, Fundamentals of Convolutional Coding. Piscataway, NJ: IEEE Press, 1999.
9. J. H. Griesmer, "A bound for error-correcting codes," IBM J. Res. Develop., vol. 4, pp. 532-542, 1960.
10. R. Sedgewick, Algorithms in C, 3rd ed. Reading, MA: Addison-Wesley, 1998.
11. I. E. Bocharova, M. Handlery, R. Johannesson, and B. D. Kudryashov, "Tailbiting codes obtained via convolutional codes with large active distance-slopes," IEEE Trans. Inform. Theory, vol. 48, pp. 2577-2587, Sept. 2002.
12. I. E. Bocharova, R. Johannesson, B. D. Kudryashov, and P. Ståhl, "Tailbiting codes: Bounds and search results," IEEE Trans. Inform. Theory, vol. 48, pp. 137-148, Jan. 2002.
13. P. Heijnen and H. van Tilborg, "The decoding of binary quasicyclic codes," in Communication and Coding, M. Darnell and B. Honary, Eds. London, U.K.: Research Studies/Wiley, 1998, pp. 146-159.
14. A. J. Viterbi, "Error bounds for convolutional codes and an asymptotically optimum decoding algorithm," IEEE Trans. Inform. Theory, vol. IT-13, pp. 260-269, Apr. 1967.
15. A. E. Brouwer and T. Verhoeff, "An updated table of minimum-distance bounds for binary linear codes," IEEE Trans. Inform. Theory, vol. 39, pp. 662-677, Mar. 1993.