default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID5. ICMCTA 2017: Vihula, Estonia
- Ángela I. Barbero, Vitaly Skachek, Øyvind Ytrehus:
Coding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017, Vihula, Estonia, August 28-31, 2017, Proceedings. Lecture Notes in Computer Science 10495, Springer 2017, ISBN 978-3-319-66277-0 - Daniele Bartoli
, Alexander A. Davydov, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco:
New Bounds for Linear Codes of Covering Radius 2. 1-10 - Allison Beemer, Christine A. Kelley:
Multidimensional Decoding Networks for Trapping Set Analysis. 11-20 - Allison Beemer, Carolyn Mayer, Christine A. Kelley:
Erasure Correction and Locality of Hypergraph Codes. 21-29 - José Joaquín Bernal, Juan Jacobo Simón:
Reed-Muller Codes: Information Sets from Defining Sets. 30-47 - Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek, Yauhen Yakimenka:
Distance Properties of Short LDPC Codes and Their Impact on the BP, ML and Near-ML Decoding Performance. 48-61 - Sara D. Cardell, Joan-Josep Climent, Alicia Roca:
Decoding a Perturbed Sequence Generated by an LFSR. 62-71 - Joan-Josep Climent, Verónica Requena, Xaro Soler-Escrivà:
A Construction of Orbit Codes. 72-83 - Elena Egorova, Grigory Kabatiansky:
Analysis of Two Tracing Traitor Schemes via Coding Theory. 84-92 - Shlomo Engelberg, Osnat Keren:
Reliable Communication Across Parallel Asynchronous Channels with Glitches. 93-106 - Cristina Fernández-Córdoba, Carlos Vela, Mercè Villanueva:
On the Kernel of \mathbb Z_2^s -Linear Hadamard Codes. 107-117 - Olav Geil, Daniel E. Lucani:
Random Network Coding over Composite Fields. 118-127 - Olav Geil, Ferruh Özbudak:
Bounding the Minimum Distance of Affine Variety Codes Using Symbolic Computations of Footprints. 128-138 - Matthias Grezet, Ragnar Freij-Hollanti, Thomas Westerbäck, Camilla Hollanti:
On Binary Matroid Minors and Applications to Data Storage over Small Fields. 139-153 - Kathryn Haymaker:
Absorbing Set Analysis of Codes from Affine Planes. 154-162 - Daniel Heinlein, Sascha Kurz:
Asymptotic Bounds for the Sizes of Constant Dimension Codes and an Improved Lower Bound. 163-191 - Somphong Jitman, Herbert S. Palines, Romar B. dela Cruz:
On Quasi-Abelian Complementary Dual Codes. 192-206 - Trygve Johnsen, Hugues Verdure:
Relative Generalized Hamming Weights and Extended Weight Polynomials of Almost Affine Codes. 207-216 - Alexey Kreshchuk, Igor V. Zhilin, Victor V. Zyablov:
On the Performance of Block Woven Codes Constructions with Row-Wise Permutations. 217-227 - Antti Laaksonen, Patric R. J. Östergård:
New Lower Bounds on Error-Correcting Ternary, Quaternary and Quinary Codes. 228-237 - Diego Napp, Ricardo Pereira, Paula Rocha:
A State Space Approach to Periodic Convolutional Codes. 238-247 - Diego Napp, Raquel Pinto, Joachim Rosenthal, Filipa Santana:
Column Rank Distances of Rank Metric Convolutional Codes. 248-256 - Raquel Pinto, Rita Simões:
On Minimality of ISO Representation of Basic 2D Convolutional Codes. 257-271 - Hila Rabii, Osnat Keren:
A New Construction of Minimum Distance Robust Codes. 272-282 - Eldho K. Thomas, Vitaly Skachek:
Constructions and Bounds for Batch Codes with Small Parameters. 283-295
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-19 22:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
