Sequences II
Methods in Communication, Security, and Computer Science
Published in January 1993
Book
Hardback
XVII, 477 pages
978-3-540-97940-1 (ISBN)
Description
An up-to-date view of several topics in theoretical computer science. The contributions to this volume include: methods for finding the smallest possible Markov Chain that could produce a given sequence of numbers; string matching algorithms; and techniques for designing error-correcting codes.