On the complexity of computing the capacity of codes that avoid forbidden difference patterns
(2006) Proceedings of the 17th International Symposium on Mathematical Theory of Networks and Systems (MTNS2006) — Location: Kyoto, Japan
Files
No attached file found for this publication.
Details
- Authors
- Affiliations
Citations
Blondel, V., & Jungers, R. (2006). On the complexity of computing the capacity of codes that avoid forbidden difference patterns. Proceedings of the 17th International Symposium on Mathematical Theory of Networks and Systems (MTNS2006), Kyoto, Japan. https://hdl.handle.net/2078.5/225385