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 65 matches
- 2016
- Adel Alahmadi, Steven T. Dougherty, André Leroy, Patrick Solé:
On the duality and the direction of polycyclic codes. Adv. Math. Commun. 10(4): 921-929 (2016) - Ismara Álvarez-Barrientos, Mijail Borges-Quintana, Miguel Angel Borges-Trenard, Daniel Panario:
Computing Gröbner bases associated with lattices. Adv. Math. Commun. 10(4): 851-860 (2016) - Daniele Bartoli, Alexander A. Davydov, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco:
Further results on multiple coverings of the farthest-off points. Adv. Math. Commun. 10(3): 613-632 (2016) - Daniele Bartoli, Adnen Sboui, Leo Storme:
Bounds on the number of rational points of algebraic hypersurfaces over finite fields, with applications to projective Reed-Muller codes. Adv. Math. Commun. 10(2): 355-365 (2016) - Aicha Batoul, Kenza Guenda, T. Aaron Gulliver:
Some constacyclic codes over finite chain rings. Adv. Math. Commun. 10(4): 683-694 (2016) - José Joaquín Bernal, Diana H. Bueno-Carreño, Juan Jacobo Simón:
Cyclic and BCH codes whose minimum distance equals their maximum BCH bound. Adv. Math. Commun. 10(2): 459-474 (2016) - Giuseppe Bianchi, Lorenzo Bracciale, Keren Censor-Hillel, Andrea Lincoln, Muriel Médard:
The one-out-of-k retrieval problem and linear network coding. Adv. Math. Commun. 10(1): 95-112 (2016) - Ian F. Blake, V. Kumar Murty, Hamid Usefi:
A note on diagonal and Hermitian hypersurfaces. Adv. Math. Commun. 10(4): 753-764 (2016) - Holger Boche, Rafael F. Schaefer:
Arbitrarily varying multiple access channels with conferencing encoders: List decoding and finite coordination resources. Adv. Math. Commun. 10(2): 333-354 (2016) - Delphine Boucher:
Construction and number of self-dual skew codes over 픽p2. Adv. Math. Commun. 10(4): 765-795 (2016) - Xiwang Cao, Hao Chen, Sihem Mesnager:
Further results on semi-bent functions in polynomial form. Adv. Math. Commun. 10(4): 725-741 (2016) - Sara D. Cardell, Joan-Josep Climent:
An approach to the performance of SPC product codes on the erasure channel. Adv. Math. Commun. 10(1): 11-28 (2016) - Sara D. Cardell, Amparo Fúster-Sabater:
Modelling the shrinking generator in terms of linear CA. Adv. Math. Commun. 10(4): 797-809 (2016) - Claude Carlet, Sylvain Guilley:
Complementary dual codes for counter-measures to side-channel attacks. Adv. Math. Commun. 10(1): 131-150 (2016) - Jesús Carrillo-Pacheco, Felipe Zaldívar:
On codes over FFN(1, q)-projective varieties. Adv. Math. Commun. 10(2): 209-220 (2016) - Joan-Josep Climent, Juan Antonio López-Ramos:
Public key protocols over the ring Epm. Adv. Math. Commun. 10(4): 861-870 (2016) - Joan-Josep Climent, Diego Napp, Raquel Pinto, Rita Simões:
Decoding of 2D convolutional codes over an erasure channel. Adv. Math. Commun. 10(1): 179-193 (2016) - Gérard D. Cohen, Sihem Mesnager, Hugues Randriam:
Yet another variation on minimal linear codes. Adv. Math. Commun. 10(1): 53-61 (2016) - Irene Marquez Corbella, Edgar Martínez-Moro, Emilio Suárez-Canedo:
On the ideal associated to a linear code. Adv. Math. Commun. 10(2): 229-254 (2016) - Dean Crnkovic, Marija Maksimovic, Bernardo Gabriel Rodrigues, Sanja Rukavina:
Self-orthogonal codes from the strongly regular graphs on up to 40 vertices. Adv. Math. Commun. 10(3): 555-582 (2016) - Javier de la Cruz, Michael Kiermaier, Alfred Wassermann, Wolfgang Willems:
Algebraic structures of MRD codes. Adv. Math. Commun. 10(3): 499-510 (2016) - Steven T. Dougherty, Esengül Saltürk, Steve Szabo:
Codes over local rings of order 16 and binary codes. Adv. Math. Commun. 10(2): 379-391 (2016) - Xiaoni Du, Chenhuang Wu, Wanyin Wei:
An extension of binary threshold sequences from Fermat quotients. Adv. Math. Commun. 10(4): 743-752 (2016) - Jérôme Ducoat, Frédérique E. Oggier:
On skew polynomial codes and lattices from quotients of cyclic division algebras. Adv. Math. Commun. 10(1): 79-94 (2016) - Serhii Dyshko:
On extendability of additive code isometries. Adv. Math. Commun. 10(1): 45-52 (2016) - Ettore Fornasini, Telma Pinho, Raquel Pinto, Paula Rocha:
Composition codes. Adv. Math. Commun. 10(1): 163-177 (2016) - Stephen M. Gagola III, Joanne L. Hall:
Constructing commutative semifields of square order. Adv. Math. Commun. 10(2): 291-306 (2016) - Heide Gluesing-Luerssen, Carolyn Troha:
Construction of subspace codes through linkage. Adv. Math. Commun. 10(3): 525-540 (2016) - José Gómez-Torrecillas, Francisco Javier Lobillo, Gabriel Navarro:
Convolutional codes with a matrix-algebra word-ambient. Adv. Math. Commun. 10(1): 29-43 (2016) - Keisuke Hakuta, Hisayoshi Sato, Tsuyoshi Takagi:
On tameness of Matsumoto-Imai central maps in three variables over the finite field 픽2. Adv. Math. Commun. 10(2): 221-228 (2016)
skipping 35 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 2025-01-03 02:30 CET 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