Información General

• Autores: Angela Barbero Díez (coord.), Vitaly Skachek (coord.), Oyvind Ytrehus (coord.)
• Editores: Springer International Publishing AG
• Año de publicación: 2017
• País: Suiza
• Idioma: inglés
• ISBN: 978-3-319-66278-7, 978-3-319-66277-0
• Texto completo no disponible (Saber más ...)

Otros catálogos

• Red de Bibliotecas Universitarias (REBIUN)

Listado de artículos

• • New Bounds for Linear Codes of Covering Radius 2

    Daniele Bartoli, Alexander A. Davydov, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco

    págs. 1-10

    

  • Multidimensional Decoding Networks for Trapping Set Analysis

    Allison Beemer, Christine A. Kelley

    págs. 11-20

    

  • Erasure correction and locality of hypergraph codes

    Allison Beemer, Carolyn Mayer, Christine A. Kelley

    págs. 21-29

    

  • Reed-muller codes: Information Sets from Defining Sets

    José Joaquín Bernal Buitrago, Juan Jacobo Simón

    págs. 30-47

    

  • 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

    págs. 48-61

    

  • Decoding a perturbed sequence generated by an LFSR

    Sara Díaz Cardell, Joan-Josep Climent Coloma, Alicia Roca Martínez

    págs. 62-71

    

  • A construction of orbit codes

    Joan-Josep Climent Coloma, Verónica Requena Arévalo, Xaro Soler Escrivà

    págs. 72-83

    

  • Analysis of two tracing traitor schemes via coding theory

    Elena Egorova, Grigory Kabatiansky

    págs. 84-92

    

  • Reliable communication across parallel asynchronous channels with glitches

    Shlomo Engelberg, Osnat Keren

    págs. 93-106

    

  • On the kernel of Z2s -Linear hadamard codes

    Cristina Fernández Córdoba, Carlos Vela, Mercedes Villanueva Merino

    págs. 107-117

    

  • Random network coding over composite fields

    Olav Geil, Daniel E. Lucani

    págs. 118-127

    

  • Bounding the minimum distance of affine variety codes using symbolic computations of footprints

    Olav Geil, Ferruh Özbudak

    págs. 128-138

    

  • On binary matroid minors and applications to data storage over small fields

    Matthias Grezet, Ragnar Freij Hollanti, Thomas Westerbäck, Camilla Hollant

    págs. 139-153

    

  • Absorbing set analysis of codes from affine planes

    Kathryn Haymaker

    págs. 154-162

    

  • Asymptotic bounds for the sizes of constant dimension codesand an improved lower bound.

    Daniel Heinlei, Sascha Kurz

    págs. 163-191

    

  • On quasi-abelian complementary dual codes

    Somphomg Jitman, Herbert S. Palines, Romar B. dela Cruz

    págs. 192-206

    

  • Relative generalized hamming weights and extended weightpolynomials of almost affine codes

    Trygve Johnsen, Hugues Verdure

    págs. 207-216

    

  • On the performance of block woven codes constructionswith row-wise permutations

    Alexey Kreshchuk, Igor Zhilin, Victor Zyablov

    págs. 217-227

    

  • New lower bounds on error-correcting ternary, quaternaryand quinary codes

    Antti Laaksonen, Patric R. J. Östergard

    págs. 228-237

    

  • A state space approach to periodic convolutional codes

    Diego Napp Avelli, Ricardo Pereira, Paula Rocha

    págs. 238-247

    

  • Column rank distances of rank metric convolutional codes

    Diego Napp Avelli, Raquel Pinto, Joachim Rosenthal, Filipa Santana

    págs. 248-256

    

  • On minimality of ISO representation of basic 2D convolutional codes

    Raquel Pinto, Rita Simões

    págs. 257-271

    

  • A new construction of minimum distance robust codes

    Hila Rabii, Osnat Keren

    págs. 272-282

    

  • Constructions and bounds for batch codes with small parameters

    Eldho K. Thomas, Vitaly Skachek

    págs. 283-296