Abstract
The main result of the present paper is to establish an algorithm for computing a linear error-correcting code called lexicode in O(nd-1) steps, where n and d are the size and distance of the code, respectively. This is done by using the theory of combinatorial games, specifically, two-player cellular automata games. Previous algorithms were exponential in n. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Fraenkel, A. S., & Rahat, O. (2003). Complexity of error-correcting codes derived from combinatorial games. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2883, 201–212. https://doi.org/10.1007/978-3-540-40031-8_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
