Advertisement

Coding Theory and Applications

5th International Castle Meeting, ICMCTA 2017, Vihula, Estonia, August 28-31, 2017, Proceedings

  • Ángela I. Barbero
  • Vitaly Skachek
  • Øyvind Ytrehus
Conference proceedings ICMCTA 2017

Part of the Lecture Notes in Computer Science book series (LNCS, volume 10495)

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 10495)

Table of contents

  1. Front Matter
    Pages I-X
    PDF
  2. New Bounds for Linear Codes of Covering Radius 2
    Daniele Bartoli, Alexander A. Davydov, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco
    Pages 1-10
  3. Multidimensional Decoding Networks for Trapping Set Analysis
    Allison Beemer, Christine A. Kelley
    Pages 11-20
  4. Erasure Correction and Locality of Hypergraph Codes
    Allison Beemer, Carolyn Mayer, Christine A. Kelley
    Pages 21-29
  5. Reed-Muller Codes: Information Sets from Defining Sets
    José Joaquín Bernal, Juan Jacobo Simón
    Pages 30-47
  6. Distance Properties of Short LDPC Codes and Their Impact on the BP, ML and Near-ML Decoding Performance
    Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek, Yauhen Yakimenka
    Pages 48-61
  7. Decoding a Perturbed Sequence Generated by an LFSR
    Sara D. Cardell, Joan-Josep Climent, Alicia Roca
    Pages 62-71
  8. A Construction of Orbit Codes
    Joan-Josep Climent, Verónica Requena, Xaro Soler-Escrivà
    Pages 72-83
  9. Analysis of Two Tracing Traitor Schemes via Coding Theory
    Elena Egorova, Grigory Kabatiansky
    Pages 84-92
  10. Reliable Communication Across Parallel Asynchronous Channels with Glitches
    Shlomo Engelberg, Osnat Keren
    Pages 93-106
  11. On the Kernel of \(\mathbb {Z}_{2^s}\)-Linear Hadamard Codes
    Cristina Fernández-Córdoba, Carlos Vela, Mercè Villanueva
    Pages 107-117
  12. Random Network Coding over Composite Fields
    Olav Geil, Daniel E. Lucani
    Pages 118-127
  13. Bounding the Minimum Distance of Affine Variety Codes Using Symbolic Computations of Footprints
    Olav Geil, Ferruh Özbudak
    Pages 128-138
  14. On Binary Matroid Minors and Applications to Data Storage over Small Fields
    Matthias Grezet, Ragnar Freij-Hollanti, Thomas Westerbäck, Camilla Hollanti
    Pages 139-153
  15. Absorbing Set Analysis of Codes from Affine Planes
    Kathryn Haymaker
    Pages 154-162
  16. Asymptotic Bounds for the Sizes of Constant Dimension Codes and an Improved Lower Bound
    Daniel Heinlein, Sascha Kurz
    Pages 163-191
  17. On Quasi-Abelian Complementary Dual Codes
    Somphong Jitman, Herbert S. Palines, Romar B. dela Cruz
    Pages 192-206
  18. Relative Generalized Hamming Weights and Extended Weight Polynomials of Almost Affine Codes
    Trygve Johnsen, Hugues Verdure
    Pages 207-216
  19. On the Performance of Block Woven Codes Constructions with Row-Wise Permutations
    Alexey Kreshchuk, Igor Zhilin, Victor Zyablov
    Pages 217-227
  20. New Lower Bounds on Error-Correcting Ternary, Quaternary and Quinary Codes
    Antti Laaksonen, Patric R. J. Östergård
    Pages 228-237
  21. A State Space Approach to Periodic Convolutional Codes
    Diego Napp, Ricardo Pereira, Paula Rocha
    Pages 238-247
  22. Column Rank Distances of Rank Metric Convolutional Codes
    Diego Napp, Raquel Pinto, Joachim Rosenthal, Filipa Santana
    Pages 248-256
  23. On Minimality of ISO Representation of Basic 2D Convolutional Codes
    Raquel Pinto, Rita Simões
    Pages 257-271
  24. A New Construction of Minimum Distance Robust Codes
    Hila Rabii, Osnat Keren
    Pages 272-282
  25. Constructions and Bounds for Batch Codes with Small Parameters
    Eldho K. Thomas, Vitaly Skachek
    Pages 283-295
  26. Back Matter
    Pages 297-297
    PDF

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 5th International Castle Meeting on Coding Theory and Applications, ICMCTA 2017, held in Vihula, Estonia, in August 2017.

The 24 full papers presented were carefully reviewed and selected for inclusion in this volume. The papers cover relevant research areas in modern coding theory, including codes and combinatorial structures, algebraic geometric codes, group codes, convolutional codes, network coding, other applications to communications, and applications of coding theory in cryptography.

 

Keywords

binary codes bit error rate block codes data communication systems encoding (symbols) finite element method image compression image processing information theory iterative decoding linear codes matrix algebra network coding probability project management semantics software engineering telecommunication networks turbo codes wireless telecommunication systems

Editors and affiliations

  1. 1.University of ValladolidValladolidSpain
  2. 2.University of TartuTartuEstonia
  3. 3.Simula@UiB and University of BergenBergenNorway

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-66278-7
  • Copyright Information Springer International Publishing AG 2017
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-66277-0
  • Online ISBN 978-3-319-66278-7
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site