![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 25 matches
- 2001
- Nuh Aydin, Irfan Siap, Dwijendra K. Ray-Chaudhuri:
The Structure of 1-Generator Quasi-Twisted Codes and New Linear Codes. Des. Codes Cryptogr. 24(3): 313-326 (2001) - A. Baliga:
Cocyclic Codes of Length 40. Des. Codes Cryptogr. 24(2): 171-179 (2001) - Simeon Ball, Ray Hill, Ivan N. Landjev, Harold N. Ward:
On (q2+q+2, q+2)-arcs in the Projective Plane PG(2, q). Des. Codes Cryptogr. 24(2): 205-224 (2001) - Edoardo Ballico, Antonio Cossidente:
Curves in Projective Spaces and Almost MDS Codes. Des. Codes Cryptogr. 24(2): 233-237 (2001) - Sönke Blunck:
On the Existence and Construction of Tight Fourth Order Quadrature Rules for the Sphere. Des. Codes Cryptogr. 24(2): 159-169 (2001) - Carlo Blundo, Annalisa De Bonis, Alfredo De Santis:
Improved Schemes for Visual Cryptography. Des. Codes Cryptogr. 24(3): 255-278 (2001) - Martin Bokler:
Minimal Blocking Sets in Projective Spaces of Square Order. Des. Codes Cryptogr. 24(2): 131-144 (2001) - Chris Boner:
Maximal Weight Divisors of Projective Reed-Muller Codes. Des. Codes Cryptogr. 24(1): 43-47 (2001) - Houshou Chen, John T. Coffey:
Trellis Structure and Higher Weights of Extremal Self-Dual Codes. Des. Codes Cryptogr. 24(1): 15-36 (2001) - Mariko Hagita, Bernhard Schmidt:
Bijections Between Group Rings Preserving Character Sums. Des. Codes Cryptogr. 24(3): 243-254 (2001) - Iiro S. Honkala, Tero Laihonen, Sanna M. Ranto:
On Codes Identifying Sets of Vertices in Hamming Spaces. Des. Codes Cryptogr. 24(2): 193-204 (2001) - Garry Hughes:
Structure Theorems for Group Ring Codes with an Application to Self-Dual Codes. Des. Codes Cryptogr. 24(1): 5-14 (2001) - Zvonimir Janko, Hadi Kharaghani, Vladimir D. Tonchev:
The Existence of a Bush-Type Hadamard Matrix of Order 324 and Two New Infinite Classes of Symmetric Designs. Des. Codes Cryptogr. 24(2): 225-232 (2001) - Amir K. Khandani, Morteza Esmaeili:
Successive Minimization of the State Complexity of the Self-dual Lattices Using Korkin-Zolotarev Reduced Basis. Des. Codes Cryptogr. 24(2): 145-158 (2001) - Jeong-Heon Kim, Hong-Yeop Song:
Trace Representation of Legendre Sequences. Des. Codes Cryptogr. 24(3): 343-348 (2001) - István Kovács:
On the Internal Nuclei of Sets in is Odd. Des. Codes Cryptogr. 24(1): 37-42 (2001) - Clement W. H. Lam, Ying Miao:
Difference Families. Des. Codes Cryptogr. 24(3): 291-304 (2001) - Kwok-Yan Lam, Francesco Sica:
The Weight Distribution of C5(1, n). Des. Codes Cryptogr. 24(2): 181-191 (2001) - Wenbo Mao:
Verifiable Partial Escrow of Integer Factors. Des. Codes Cryptogr. 24(3): 327-342 (2001) - Gabriele Nebe, Eric M. Rains, Neil J. A. Sloane:
The Invariants of the Clifford Groups. Des. Codes Cryptogr. 24(1): 99-122 (2001) - Siaw-Lynn Ng, Michael Walker:
On the Composition of Matroids and Ideal Secret Sharing Schemes. Des. Codes Cryptogr. 24(1): 49-67 (2001) - Igor E. Shparlinski, Joseph H. Silverman:
On the Linear Complexity of the Naor-Reingold Pseudo-random Function from Elliptic Curves. Des. Codes Cryptogr. 24(3): 279-289 (2001) - Horacio Tapia-Recillas, Gerardo Vega:
An Upper Bound on the Number of Iterations for Transforming a Boolean Function of Degree Greater or Equal Than 4 to a Function of Degree 3. Des. Codes Cryptogr. 24(3): 305-312 (2001) - Pascal Véron:
True Dimension of Some Binary Quadratic Trace Goppa Codes. Des. Codes Cryptogr. 24(1): 81-97 (2001) - Dianhua Wu, Lei Zhu:
Generalized Steiner Systems GS(2, 4, v, 2) with a Prime Power equiv 7 (mod 12). Des. Codes Cryptogr. 24(1): 69-80 (2001)
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-09-05 16:24 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