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 13 matches
- 2025
- Bart De Bruyn, Puspendu Pradhan, Binod Kumar Sahoo:
Blocking sets of secant and tangent lines with respect to a quadric of PG (n,q). Des. Codes Cryptogr. 93(6): 1739-1760 (2025) - 2024
- Anlan Yu, Shusen Jing, Ning Lyu, Wujie Wen, Zhiyuan Yan:
Error Correction Output Codes for Robust Neural Networks against Weight-errors: A Neural Tangent Kernel Point of View. NeurIPS 2024 - 2015
- Susan G. Barwick
, Wen-Ai Jackson:
An investigation of the tangent splash of a subplane of PG(2, q3). Des. Codes Cryptogr. 76(3): 451-468 (2015) - 2014
- Susan G. Barwick
, Wen-Ai Jackson:
A characterisation of tangent subplanes of PG(2, q 3). Des. Codes Cryptogr. 71(3): 541-545 (2014) - Azniv Kasparian, Evgeniya Velikova:
Tangent Codes. CoRR abs/1409.4583 (2014) - 2013
- Ichiro Shimada:
A note on rational normal curves totally tangent to a Hermitian variety. Des. Codes Cryptogr. 69(3): 299-303 (2013) - 2008
- Sheng Tong:
Tangential Sphere Bounds on the Ensemble Performance of ML Decoded Gallager Codes via Their Exact Ensemble Distance Spectrum. ICC 2008: 1150-1154 - 2007
- Moulay Hicham Tber, Laurent Hascoët, Arthur Vidard, Benjamin Dauvergne:
Building the Tangent and Adjoint codes of the Ocean General Circulation Model OPA with the Automatic Differentiation tool TAPENADE. CoRR abs/0711.4444 (2007) - 2004
- Gloria Rinaldi
:
Key Distribution Patterns Using Tangent Circle Structures. Des. Codes Cryptogr. 31(3): 289-300 (2004) - Shahram Yousefi, Amir K. Khandani:
Generalized Tangential Sphere Bound on the MLDecoding Error Probability of Linear Binary Block Codes in AWGN Interference. IEEE Trans. Inf. Theory 50(11): 2810-2815 (2004) - 2003
- Aart Blokhuis, Tamás Szonyi, Zsuzsa Weiner:
On Sets without Tangents in Galois Planes of Even Order. Des. Codes Cryptogr. 29(1-3): 91-98 (2003) - 2001
- Johannes Zangl, Rupert Herzog:
Improved tangential sphere bound on the bit-error probability of concatenated codes. IEEE J. Sel. Areas Commun. 19(5): 825-830 (2001) - 1995
- Jarkko Kari, Valtteri Niemi:
Colored Gauss and Tangent Codes on the Torus. Developments in Language Theory 1995: 54-63
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-07-20 01:32 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