On the complexity of computing the capacity of codes that avoid forbidden difference patterns

IEEE Transactions on Information Theory

Volumn 52, Issue 11, 2006, Pages 5122-5127

  Blondel, Vincent D ^a   Jungers, Rafaël ^a   Protasov, Vladimir ^b  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^b MOSCOW STATE UNIVERSITY   (Russian Federation)

Author keywords

Approximation algorithm; Capacity of codes; Coding theory; Complexity of capacity; Joint spectral radius; NP hardness

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; ENCODING (SYMBOLS); MATRIX ALGEBRA; POLYNOMIALS;

APPROXIMATION ALGORITHM; CODING THEORY; JOINT SPECTRAL RADIUS;

CODES (SYMBOLS);

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

References (20)

1. A. V. Aho, "Algorithms for finding patterns in strings," in Handbook of Theoretical Computer Science (vol. A): Algorithms and Complexity. Cambridge, MA: MIT Press, 1990, pp. 255-300.
2. N. Barabanov, "Lyapunov indicators of discrete inclusions. Part I, II and III," (in Russian) Avtomat i Telemekh., vol. 2, pp. 40-46, 1988.
3. M. A. Berger and Y. Wang, "Bounded semigroups of matrices," J. Linear Algebra Appl., vol. 166, pp. 21-27, 1992.
4. V. D. Blondel and Y. Nesterov, "Computationally efficient approximations of the joint spectral radius," SIAM J. Matrix Anal., vol. 27, no. 1, pp. 256-272, 2005.
5. V. D. Blondel and J. N. Tsitsiklis, "A survey of computational complexity results in systems and control," Automatica, vol. 36, no. 9, pp. 1249-1274, 2000.
6. V. D. Blondel and J. N. Tsitsiklis, "The boundedness of all products of a pair of matrices is undecidable," Syst. Contr. Lett., vol. 41, no. 2, pp. 135-140, 2000.
7. V. D. Blondel, J. Theys, and A. A. Vladimirov, "An elementary counterexample to the finiteness conjecture," SIAM J. Matrix Anal., vol. 24, no. 4, pp. 963-970, 2003.
8. T. Bousch and J. Mairesse, "Asymptotic height optimization for topical IFS, tetris heaps, and the finiteness conjecture," J. Math. Amer. Soc., vol. 15, no. 1, pp. 77-111, 2002.
9. I. Daubechies and J. C. Lagarias, "Sets of matrices all infinite products of which converge," Linear Algebra Appl., vol. 161, pp. 227-263, 1992.
10. M. R. Garey and D. S. Johnson, Computers and Intractability - A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
11. R. Jungers, "NP-Completeness of the Computation of the Capacity of Constraints on Codes," Master's thesis, Université Catholique de Louvain-La-Neuve, Louvain-La-Neuve, Belgium, 2005.
12. V. Kozyakin, "A dynamical systems construction of a counterexample to the finiteness conjecture," in Proc. 44th IEEE Conf. Decision and Control (ECC 2005), 2005.
13. B. E. Moision, A. Orlitsky, and P. H. Siegel, "On codes with local joint constraints," 2004, unpublished manuscript.
14. B. E. Moision, A. Orlitsky, and P. H. Siegel, "Bounds on the rate of codes which forbid specified difference sequences," in Proc. 1999 IEEE Global Telecommun. Conf. (GLOBECOM '99), Dec. 1999.
15. B. E. Moision, A. Orlitsky, and P. H. Siegel, "On codes that avoid specified differences," IEEE Trans. Inf. Theory, vol. 47, no. 1, pp. 433-422, Jan. 2001.
16. V. Protasov, "The joint spectral radius and invariant sets of linear operators," Fundamentalnaya i Prikladnaya Matematika, vol. 2, no. 1, pp. 205-231, 1996.
17. V. Protasov, "On the asymptotics of the partition function," Sb. Math., vol. 191, no. 3-4, pp. 381-414, 2000.
18. V. Protasov, "The geometric approach for computing the joint spectral radius," in Proc. 44th IEEE Conf. Decision and Control (ECC 2005), 2005.
19. G. C. Rota and C. Strang, "A note on the joint spectral radius," Indag. Math., vol. 22, pp. 379-381, 1960.
20. J. Tsitsiklis and V. Blondel, "The Lyapunov exponent and joint spectral radius of pairs of matrices are hard - when not impossible - to compute and to approximate," Math. Contr., Signals, Syst., vol. 10, no. 31, pp. 40-40, 1997.