• 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.

found 31 matches

• 2014
• 
  Johannes Braun, Johannes Buchmann, Ciaran Mullan, Alexander Wiesmaier:
  Long term confidentiality: a survey. Des. Codes Cryptogr. 71(3): 459-478 (2014)
• 
  Vladimir Anashin, Andrei Yu. Khrennikov, Ekaterina Yurova:
  T-functions revisited: new criteria for bijectivity/transitivity. Des. Codes Cryptogr. 71(3): 383-407 (2014)
• 
  S. Arumugam, R. Lakshmanan, Atulya K. Nagar:
  On (k, n)*-visual cryptography scheme. Des. Codes Cryptogr. 71(1): 153-162 (2014)
• 
  Daniele Bartoli, Maarten De Boeck, Stefania Fanali, Leo Storme:
  On the functional codes defined by quadrics and Hermitian varieties. Des. Codes Cryptogr. 71(1): 21-46 (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)
• 
  Aart Blokhuis, Andries E. Brouwer, Attila Sali:
  Note on the size of binary Armstrong codes. Des. Codes Cryptogr. 71(1): 1-4 (2014)
• 
  Jie Chen, Hoon Wei Lim, San Ling, Huaxiong Wang:
  The relation and transformation between hierarchical inner product encryption and spatial encryption. Des. Codes Cryptogr. 71(2): 347-364 (2014)
• 
  Peipei Dai, Jianmin Wang, Jianxing Yin:
  Combinatorial constructions for optimal 2-D optical orthogonal codes with AM-OPPTS property. Des. Codes Cryptogr. 71(2): 315-330 (2014)
• 
  Peter Dukes, Lea Howard:
  Group divisible designs in MOLS of order ten. Des. Codes Cryptogr. 71(2): 283-291 (2014)
• 
  Anthony B. Evans:
  Mutually orthogonal Latin squares based on general linear groups. Des. Codes Cryptogr. 71(3): 479-492 (2014)
• 
  Yun Fan, San Ling, Hongwei Liu:
  Matrix product codes over finite commutative Frobenius rings. Des. Codes Cryptogr. 71(2): 201-227 (2014)
• 
  Thijs Laarhoven, Benne de Weger:
  Optimal symmetric Tardos traitor tracing schemes. Des. Codes Cryptogr. 71(1): 83-103 (2014)
• 
  Pierre Loidreau:
  Asymptotic behaviour of codes in rank metric over finite fields. Des. Codes Cryptogr. 71(1): 105-118 (2014)
• 
  Hiram H. Lopez, Carlos Rentería-Márquez, Rafael H. Villarreal:
  Affine cartesian codes. Des. Codes Cryptogr. 71(1): 5-19 (2014)
• 
  Tomas Nilson, Pia Heidtmann:
  Inner balance of symmetric designs. Des. Codes Cryptogr. 71(2): 247-260 (2014)
• 
  Wakaha Ogata, Hiroshi Eguchi:
  Cheating detectable threshold scheme against most powerful cheaters for long secrets. Des. Codes Cryptogr. 71(3): 527-539 (2014)
• 
  Maura B. Paterson, Douglas R. Stinson:
  A unified approach to combinatorial key predistribution schemes for sensor networks. Des. Codes Cryptogr. 71(3): 433-457 (2014)
• 
  Christophe Petit:
  Towards factoring in $${SL(2, \, \mathbb{F}_{2n})}$$. Des. Codes Cryptogr. 71(3): 409-431 (2014)
• 
  Reza Sepahi, Ron Steinfeld, Josef Pieprzyk:
  Lattice-based completely non-malleable public-key encryption in the standard model. Des. Codes Cryptogr. 71(2): 293-313 (2014)
• 
  Anuradha Sharma, Amit K. Sharma:
  On some new m-spotty Lee weight enumerators. Des. Codes Cryptogr. 71(1): 119-152 (2014)
• 
  Nigel P. Smart, Frederik Vercauteren:
  Fully homomorphic SIMD operations. Des. Codes Cryptogr. 71(1): 57-81 (2014)
• 
  Klara Stokes, Oriol Farràs:
  Linear spaces and transversal designs: k-anonymous combinatorial configurations for anonymous database search notes. Des. Codes Cryptogr. 71(3): 503-524 (2014)
• 
  Klara Stokes, Oriol Farràs:
  Erratum to: Linear spaces and transversal designs: $$k$$ -anonymous combinatorial configurations for anonymous database search. Des. Codes Cryptogr. 71(3): 525 (2014)
• 
  Sihong Su, Xiaohu Tang:
  Construction of rotation symmetric Boolean functions with optimal algebraic immunity and high nonlinearity. Des. Codes Cryptogr. 71(2): 183-199 (2014)
• 
  Tian Tian, Wen-Feng Qi:
  On the largest affine sub-families of a family of NFSR sequences. Des. Codes Cryptogr. 71(1): 163-181 (2014)
• 
  Antonia Wachter-Zeh, Alexander Zeh, Martin Bossert:
  Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability. Des. Codes Cryptogr. 71(2): 261-281 (2014)
• 
  Guangfu Wu, Hsin-Chiu Chang, Lin Wang, Trieu-Kien Truong:
  Constructing rate 1/p systematic binary quasi-cyclic codes based on the matroid theory. Des. Codes Cryptogr. 71(1): 47-56 (2014)
• 
  Nam Yul Yu, Keqin Feng, Aixian Zhang:
  A new class of near-optimal partial Fourier codebooks from an almost difference set. Des. Codes Cryptogr. 71(3): 493-501 (2014)
• 
  Alexander Zeh, Sergey Bezzateev:
  A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes. Des. Codes Cryptogr. 71(2): 229-246 (2014)
• 
  Caixue Zhou, Wan Zhou, Xiwei Dong:
  Provable certificateless generalized signcryption scheme. Des. Codes Cryptogr. 71(2): 331-346 (2014)

skipping 1 more match