Endcoding complexity versus minimum distance

IEEE Transactions on Information Theory

Volumn 51, Issue 6, 2005, Pages 2103-2112

  Bazzi, Louay M J ^a   Mitter, Sanjoy K ^b  

^a AMERICAN UNIVERSITY OF BEIRUT   (Lebanon)

^b USA   (United States)

Author keywords

Binary codes; Branching programs; Encoding complexity; Minimum distance; Time space tradeoffs

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; ENCODING (SYMBOLS); ERROR CORRECTION; TURBO CODES;

BRANCHING PROGRAMS; ENCODING COMPLEXITY; MINIMUM DISTANCE; TIME SPACE TRADEOFFS;

BINARY CODES;

EID: 20544457125     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2005.847727     Document Type: Article

References (11)

1. M. Ajtai, "Determinism versus nondeterminism for linear time RAMs," in Proc 31st Annu. ACM Symp. Theory of Computing (STOC), Atlanta, GA, May 1999, pp. 632-641.
2. L. Bazzi, "Minimum distance of error correcting codes versus encoding complexity, symmetry, and pseudorandomness," Ph.D. dissertation, MIT, Cambridge, MA, 2003.
3. L. Bazzi, M. Mahdian, and D. Spielman, "The minimum distance of turbo-like codes," IEEE Trans. Inf. Theory, 2004, to be published.
4. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: Turbo-codes" in Proc., IEEE Int. Conf. Communications, Geneva, Switzerland, May 1993, pp. 1064-1070.
5. A. Borodin and S. Cook, "A time-space tradeoff for sorting on a general sequential model of computation," in SIAM J. Comput., vol. 11, 1982, pp. 287-297.
6. D. Divsalar, H. Jin, and R. J. McEliece, "Coding theorems for turbo-like codes," in Proc. 36th Annu. Allerton Conf. Communication, Control and Computing, Monticello, IL, Sep. 1998, pp. 201-210.
7. H. Jin and R. J. McEliece, "Coding theorems for turbo code ensembles," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1451-1461, Jun. 2002.
8. J. Hastad, "Computational limitations for small depth circuits," Ph.D. dissertation, MIT, Cambridge, MA, 1986.
9. N. Kahale and R. Urbanke, "On the minimum distance of parallel and serially concatenated codes," IEEE Trans. Inf. Theory, to be published.
10. N. Kahale and R. Urbank, "On the minimum distance of parallel and serially concatenated codes in Proc. IEEE Int. Symp. Information Theory, Cambridge, MA, Aug. 1998, p. 31.
11. D. A. Spielman, "Linear-time encodable and decodable error-correcting codes," IEEE Trans. Inf. Theory, vol. 42, no. 6, pp. 1723-1732, Nov. 1996.