Tailbiting codes: Bounds and search results

IEEE Transactions on Information Theory

Volumn 48, Issue 1, 2002, Pages 137-148

  Bocharova, Irina E ^b   Johannesson, Rolf ^a,c   Kudryashov, Boris D ^b   Stahl, Per ^a,c  

^a IEEE   (Sweden)

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

^c LUND UNIVERSITY   (Sweden)

Author keywords

Asymptotic complexity bounds; Quasi cyclic codes; State complexity; Tailbiting codes; Trellis

Indexed keywords

COMPUTER SEARCH; GENERATOR MATRIX; QUASI-CYCLIC CODES; STATE COMPLEXITY; TAILBITING CODES;

BLOCK CODES; COMPUTATIONAL COMPLEXITY; COMPUTER APPLICATIONS; MATRIX ALGEBRA; POLYNOMIALS; THEOREM PROVING;

TRELLIS CODES;

EID: 0036158357     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.971744     Document Type: Article

References (27)

1. Optimal decoding of linear codes for minimizing symbol error rate
2. An updated table of minimum-distance bounds for binary linear codes
3. Minimal tail-biting trellises: The Golay code and more
4. A fast algorithm for computing distance spectrum of convolutional codes
5. A link between quasi-cyclic codes and convolutional codes
6. Coset codes II: Binary lattices and related codes
7. Dimension/length profiles and trellis complexity of linear block codes
8. Minimal and canonical rational generator matrices for convolutional codes
9. Some best rate 1/p and rate (p - 1)/p systematic quasi-cyclic codes
10. Some new binary quasi-cyclic codes
11. On the trellis structure of block codes
12. The trellis structure of maximal fixed-cost codes
13. Block codes from convolutional codes
14. Decoding block codes obtained from convolutional ones
15. Soft decision decoding of block codes obtained from convolutional codes
16. Construction of minimal tail-biting trellises
17. Lower bounds on trellis complexity of block codes
18. Optimal sectionalization of a trellis
19. Table of nonlinear binary codes
20. On tail-biting convolutional codes
21. New upper bounds on the rate of the code via the Delsarte-MacWilliams inequalities
22. Minimal trellises for block codes
23. A connection between block and convolutional codes
24. Optimal and near-optimal encoders for short and moderate-length tail-biting trellises
25. Codes and iterative decoding on general graphs
26. Bounds on complexity of trellis decoding of linear block codes