Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 84 matches
- 2017
- Daniele Bartoli, Alexander A. Davydov, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco:
New Bounds for Linear Codes of Covering Radius 2. ICMCTA 2017: 1-10 - Allison Beemer, Christine A. Kelley:
Multidimensional Decoding Networks for Trapping Set Analysis. ICMCTA 2017: 11-20 - Allison Beemer, Carolyn Mayer, Christine A. Kelley:
Erasure Correction and Locality of Hypergraph Codes. ICMCTA 2017: 21-29 - José Joaquín Bernal, Juan Jacobo Simón:
Reed-Muller Codes: Information Sets from Defining Sets. ICMCTA 2017: 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. ICMCTA 2017: 48-61 - Sara D. Cardell, Joan-Josep Climent, Alicia Roca:
Decoding a Perturbed Sequence Generated by an LFSR. ICMCTA 2017: 62-71 - Joan-Josep Climent, Verónica Requena, Xaro Soler-Escrivà:
A Construction of Orbit Codes. ICMCTA 2017: 72-83 - Elena Egorova, Grigory Kabatiansky:
Analysis of Two Tracing Traitor Schemes via Coding Theory. ICMCTA 2017: 84-92 - Shlomo Engelberg, Osnat Keren:
Reliable Communication Across Parallel Asynchronous Channels with Glitches. ICMCTA 2017: 93-106 - Cristina Fernández-Córdoba, Carlos Vela, Mercè Villanueva:
On the Kernel of \mathbb Z_2s -Linear Hadamard Codes. ICMCTA 2017: 107-117 - Olav Geil, Daniel E. Lucani:
Random Network Coding over Composite Fields. ICMCTA 2017: 118-127 - Olav Geil, Ferruh Özbudak:
Bounding the Minimum Distance of Affine Variety Codes Using Symbolic Computations of Footprints. ICMCTA 2017: 128-138 - Matthias Grezet, Ragnar Freij-Hollanti, Thomas Westerbäck, Camilla Hollanti:
On Binary Matroid Minors and Applications to Data Storage over Small Fields. ICMCTA 2017: 139-153 - Kathryn Haymaker:
Absorbing Set Analysis of Codes from Affine Planes. ICMCTA 2017: 154-162 - Daniel Heinlein, Sascha Kurz:
Asymptotic Bounds for the Sizes of Constant Dimension Codes and an Improved Lower Bound. ICMCTA 2017: 163-191 - Somphong Jitman, Herbert S. Palines, Romar B. dela Cruz:
On Quasi-Abelian Complementary Dual Codes. ICMCTA 2017: 192-206 - Trygve Johnsen, Hugues Verdure:
Relative Generalized Hamming Weights and Extended Weight Polynomials of Almost Affine Codes. ICMCTA 2017: 207-216 - Alexey Kreshchuk, Igor V. Zhilin, Victor V. Zyablov:
On the Performance of Block Woven Codes Constructions with Row-Wise Permutations. ICMCTA 2017: 217-227 - Antti Laaksonen, Patric R. J. Östergård:
New Lower Bounds on Error-Correcting Ternary, Quaternary and Quinary Codes. ICMCTA 2017: 228-237 - Diego Napp, Ricardo Pereira, Paula Rocha:
A State Space Approach to Periodic Convolutional Codes. ICMCTA 2017: 238-247 - Diego Napp, Raquel Pinto, Joachim Rosenthal, Filipa Santana:
Column Rank Distances of Rank Metric Convolutional Codes. ICMCTA 2017: 248-256 - Raquel Pinto, Rita Simões:
On Minimality of ISO Representation of Basic 2D Convolutional Codes. ICMCTA 2017: 257-271 - Hila Rabii, Osnat Keren:
A New Construction of Minimum Distance Robust Codes. ICMCTA 2017: 272-282 - Eldho K. Thomas, Vitaly Skachek:
Constructions and Bounds for Batch Codes with Small Parameters. ICMCTA 2017: 283-295 - Á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 [contents] - 2015
- Raquel Pinto, Paula Rocha Malonek, Paolo Vettori:
Coding Theory and Applications, 4th International Castle Meeting, ICMCTA 2014, Palmela Castle, Portugal, September 15-18, 2014. CIM Series in Mathematical Sciences 3, Springer 2015, ISBN 978-3-319-17295-8 [contents] - 2014
- Paulo José Fernandes Almeida, Diego Napp, Raquel Pinto:
From 1D Convolutional Codes to 2D Convolutional Codes of Rate 1/n. ICMCTA 2014: 25-33 - Angela I. Barbero, Øyvind Ytrehus:
A Coding-Based Approach to Robust Shortest-Path Routing. ICMCTA 2014: 35-42 - Amaro Barreal, Camilla Hollanti, Nadya Markin:
Constructions of Fast-Decodable Distributed Space-Time Codes. ICMCTA 2014: 43-51 - Gustavo Terra Bastos, Marinês Guerreiro:
Idempotents Generators for Minimal Cyclic Codes of Length pnq. ICMCTA 2014: 345-352
skipping 54 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-05-21 01:35 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint