Latin Hypercubes and Cellular Automata

Latin squares and hypercubes are combinatorial designs with several applications in statistics, cryptography and coding theory. In this paper, we generalize a construction of Latin squares based on bipermutive cellular automata (CA) to the case of Latin h

  • PDF / 4,513,856 Bytes
  • 176 Pages / 439.37 x 666.142 pts Page_size
  • 99 Downloads / 223 Views

DOWNLOAD

REPORT


Hector Zenil (Ed.)

Cellular Automata and Discrete Complex Systems 26th IFIP WG 1.5 International Workshop, AUTOMATA 2020 Stockholm, Sweden, August 10–12, 2020 Proceedings

Lecture Notes in Computer Science Founding Editors Gerhard Goos Karlsruhe Institute of Technology, Karlsruhe, Germany Juris Hartmanis Cornell University, Ithaca, NY, USA

Editorial Board Members Elisa Bertino Purdue University, West Lafayette, IN, USA Wen Gao Peking University, Beijing, China Bernhard Steffen TU Dortmund University, Dortmund, Germany Gerhard Woeginger RWTH Aachen, Aachen, Germany Moti Yung Columbia University, New York, NY, USA

12286

More information about this series at http://www.springer.com/series/7407

Hector Zenil (Ed.)

Cellular Automata and Discrete Complex Systems 26th IFIP WG 1.5 International Workshop, AUTOMATA 2020 Stockholm, Sweden, August 10–12, 2020 Proceedings

123

Editor Hector Zenil Oxford Immune Algorithmics Reading, UK

ISSN 0302-9743 ISSN 1611-3349 (electronic) Lecture Notes in Computer Science ISBN 978-3-030-61587-1 ISBN 978-3-030-61588-8 (eBook) https://doi.org/10.1007/978-3-030-61588-8 LNCS Sublibrary: SL1 – Theoretical Computer Science and General Issues © IFIP International Federation for Information Processing 2020 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, expressed or implied, with respect to the material contained herein or for any errors or omissions that may have been made. The publisher remains neutral with regard to jurisdictional claims in published maps and institutional affiliations. This Springer imprint is published by the registered company Springer Nature Switzerland AG The registered company address is: Gewerbestrasse 11, 6330 Cham, Switzerland

Preface

This volume contains the papers accepted and presented at the 26th International Workshop on Cellular Automata (CA) and Discrete Complex Systems (DCS), AUTOMATA 2020, held during August 10–12,2020, hosted online by the Algorithmic Dynamics Lab, Karolinska Institute, Stockholm, Sweden; and Oxford Immune Algorithmics, Reading, UK. The conference is the official annual event of the International Federation for I